Sciweavers

WEA
2005
Springer
100views Algorithms» more  WEA 2005»
13 years 10 months ago
Rounding to an Integral Program
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
Refael Hassin, Danny Segev