Tight Approximation Results for General Covering Integer Programs

13 years 11 months ago

In this paper we study approximation algorithms for solving a general covering integer program. An

Stavros G. Kolliopoulos, Neal E. Young

Approximation Algorithms | CORR 2002 | Education | Multiplicity Constraints | Upper Bounds |

claim paper

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	CORR
Authors	Stavros G. Kolliopoulos, Neal E. Young

Comments (0)