Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee

A.A. Ageev () and M.I. Sviridenko ()
Additional contact information
A.A. Ageev: Sobolev Institute of Mathematics
M.I. Sviridenko: IBM T.J. Watson Research Center, P.O. Box

Journal of Combinatorial Optimization, 2004, vol. 8, issue 3, No 5, 307-328

Abstract: Abstract The paper presents a general method of designing constant-factor approximation algorithms for some discrete optimization problems with assignment-type constraints. The core of the method is a simple deterministic procedure of rounding of linear relaxations (referred to as pipage rounding). With the help of the method we design approximation algorithms with better performance guarantees for some well-known problems including MAXIMUM COVERAGE, MAX CUT with given sizes of parts and some of their generalizations.

Keywords: approximation algorithm; performance guarantee; linear relaxation; rounding technique; maximum coverage; max cut (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (26)

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000038913.96607.c2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:8:y:2004:i:3:d:10.1023_b:joco.0000038913.96607.c2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/B:JOCO.0000038913.96607.c2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().