Journal of Combinatorial Optimization

, Volume 8, Issue 3, pp 307–328

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

  • A.A. Ageev
  • M.I. Sviridenko
Article

DOI: 10.1023/B:JOCO.0000038913.96607.c2

Cite this article as:
Ageev, A. & Sviridenko, M. Journal of Combinatorial Optimization (2004) 8: 307. doi:10.1023/B:JOCO.0000038913.96607.c2

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.

approximation algorithm performance guarantee linear relaxation rounding technique maximum coverage max cut 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 2004

Authors and Affiliations

  • A.A. Ageev
    • 1
  • M.I. Sviridenko
    • 2
  1. 1.Sobolev Institute of MathematicsNovosibirskRussia
  2. 2.IBM T.J. Watson Research Center, P.O. Box

Personalised recommendations