Sciweavers

SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 5 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan