Improved Parallel Approximation of a Class of Integer Programming Problems
Algorithmica (New York)
Saved in:
Main Authors: | Alon, N., Srinivasan, A. |
---|---|
Other Authors: | INFORMATION SYSTEMS & COMPUTER SCIENCE |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/99307 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
by: Srinivasan, A., et al.
Published: (2013) -
The geometry of fractional stable matchings and its applications
by: Teo, C.-P., et al.
Published: (2013) -
Analysis of LP relaxations for multiway and multicut problems
by: Bertsimas, D., et al.
Published: (2013) -
A polynomial-time algorithm for the bistable roommates problem
by: Sethuraman, J., et al.
Published: (2013) -
Randomized approximation of the constraint satisfaction problem
by: LAU, Hoong Chuin, et al.
Published: (1996)