Optimization Online


Approximate fixed-rank closures of set covering problems

Daniel Bienstock (dano***at***columbia.edu)
Mark Zuckerberg (mz47***at***columbia.edu)

Abstract: We show that for any fixed rank, the closure of a set covering problem (and related problems) can be approximated in polynomial time -- we can epsilon-approximate any linear program over the closure in polynomial time.

Keywords: integer programming

Category 1: Integer Programming (0-1 Programming )

Category 2: Combinatorial Optimization (Approximation Algorithms )

Citation: CORC report TR-2003-01, Computational Optimization Research Center, Columbia University

Download: [PDF]

Entry Submitted: 08/26/2004
Entry Accepted: 08/26/2004
Entry Last Modified: 08/26/2004

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society