Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
- Cite this article as:
- Ageev, A. & Sviridenko, M. Journal of Combinatorial Optimization (2004) 8: 307. doi:10.1023/B:JOCO.0000038913.96607.c2
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.
Unable to display preview. Download preview PDF.