A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
SIAM Journal on Computing
Saved in:
Main Authors: | Srinivasan, A., Chung-Piaw, T. |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/44984 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Improved Parallel Approximation of a Class of Integer Programming Problems
by: Alon, N., et al.
Published: (2014) -
The geometry of fractional stable matchings and its applications
by: Teo, C.-P., et al.
Published: (2013) -
Randomized approximation of the constraint satisfaction problem
by: LAU, Hoong Chuin, et al.
Published: (1996) -
Analysis of LP relaxations for multiway and multicut problems
by: Bertsimas, D., et al.
Published: (2013) -
A new approach for weighted constraint satisfaction
by: Lau, H.C.
Published: (2013)