Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

107

CORR
2002
Springer

102views Education» more CORR 2002»

Tight Approximation Results for General Covering Integer Programs

15 years 2 months ago

Tight Approximation Results for General Covering Integer Programs

Download www.cs.ucr.edu

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

Stavros G. Kolliopoulos, Neal E. Young

Real-time Traffic

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

claim paper

Related Content

» PrimalDual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

» Approximate fixedrank closures of covering problems

» Distributed and parallel algorithms for weighted vertex cover and other covering problems

» Free Bits PCPs and NonApproximability Towards Tight Results

» Rounding algorithms for covering problems

» Free Bits PCPs and NonapproximabilityTowards Tight Results

» Cover and Pack Inequalities for Mixed Integer Programming

» Noncooperative facility location and covering games

» Rounding to an Integral Program

Post Info
More Details (n/a)

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

Comments (0)