Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
- 216 Downloads
We consider the max-bisection problem and the disjoint 2-catalog segmentation problem, two well-known NP-hard combinatorial optimization problems. For the first problem, we apply the semidefinite programming (SDP) relaxation and the RPR2 technique of Feige and Langberg (J. Algorithms 60:1–23, 2006) to obtain a performance curve as a function of the ratio of the optimal SDP value over the total weight through finer analysis under the assumption of convexity of the RPR2 function. This ratio is shown to be in the range of [0.5,1]. The performance curve implies better approximation performance when this ratio is away from 0.92, corresponding to the lowest point on this curve with the currently best approximation ratio of 0.7031 due to Feige and Langberg (J. Algorithms 60:1–23, 2006). For the second problem, similar technique results in an approximation ratio of 0.7469, improving the previously best known result 0.7317 due to Wu et al. (J. Ind. Manag. Optim. 8:117–126, 2012).
KeywordsMax-bisection problem 2-Catalog segmentation problem Approximation algorithm Semidefinite programming RPR2 rounding
The authors are grateful for the anonymous reviewers to give some helpful comments to improve this paper.
- Dodis Y, Guruswami V, Khanna S (1999) The 2-catalog segmentation problem. In: Proceedings of SODA, pp 378–380 Google Scholar
- Guruswami V, Makarychev Y, Raghavendra P, Steurer D, Zhou Y (2011) Finding almost-perfect graph bisections. In: Proceedings of ICS, pp 321–337 Google Scholar
- Kleinberg J, Papadimitriou C, Raghavan P (1998) Segmentation problems. In: Proceedings of STOC, pp 473–482 Google Scholar
- Raghavendra P, Tan N (2012) Approximating CSPs with global cardinality constraints using SDP hierarchies. In: Proceedings of SODA, pp 373–387 Google Scholar
- Saket R (2010) Quasi-random PCP and hardness of 2-catalog segmentation. In: Proceedings of FSTTCS, pp 447–458 Google Scholar
- Xu D, Ye Y, Zhang J (2002) A note on approximating the 2-catalog segmentation problem. Working Paper, Department of Management Sciences, Henry, B Tippie College of Business, The University of Iowa, Iowa City, IA, 52242, USA Google Scholar
- Zwick U (1999) Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In: Proceedings of STOC, pp 679–687 Google Scholar