In this paper we analyze a known relaxation for the Sparsest Cut problem based on positive semidefinite constraints, and we present a branch and bound algorithm and heuristics based on this relaxation. The relaxed formulation and the algorithms were tested on small and moderate sized instances. It leads to values very close to the optimum solution values. The exact algorithm could obtain solutions for small and moderate sized instances, and the best heuristics obtained optimum or near optimum solutions for all tested instances. The semidefinite relaxation gives a lower bound and each heuristic produces a cut S with a ratio , where either cS is at most a factor of C or wS is at least a factor of W. We solved the semidefinite relaxation using a semi-infinite cut generation with a commercial linear programming package adapted to the sparsest cut problem. We showed that the proposed strategy leads to a better performance compared to the use of a known semidefinite programming solver.
Mots clés : semidefinite programming, sparsest cut, combinatorics
@article{RO_2011__45_2_75_0,
author = {Meira, Luis A. A. and Miyazawa, Fl\'avio K.},
title = {Semidefinite {Programming} {Based} {Algorithms} for the {Sparsest} {Cut} {Problem}},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {75--100},
publisher = {EDP-Sciences},
volume = {45},
number = {2},
year = {2011},
doi = {10.1051/ro/2011104},
mrnumber = {2855947},
zbl = {1270.90091},
language = {en},
url = {http://www.numdam.org/articles/10.1051/ro/2011104/}
}
TY - JOUR AU - Meira, Luis A. A. AU - Miyazawa, Flávio K. TI - Semidefinite Programming Based Algorithms for the Sparsest Cut Problem JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2011 SP - 75 EP - 100 VL - 45 IS - 2 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ro/2011104/ DO - 10.1051/ro/2011104 LA - en ID - RO_2011__45_2_75_0 ER -
%0 Journal Article %A Meira, Luis A. A. %A Miyazawa, Flávio K. %T Semidefinite Programming Based Algorithms for the Sparsest Cut Problem %J RAIRO - Operations Research - Recherche Opérationnelle %D 2011 %P 75-100 %V 45 %N 2 %I EDP-Sciences %U http://www.numdam.org/articles/10.1051/ro/2011104/ %R 10.1051/ro/2011104 %G en %F RO_2011__45_2_75_0
Meira, Luis A. A.; Miyazawa, Flávio K. Semidefinite Programming Based Algorithms for the Sparsest Cut Problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 45 (2011) no. 2, pp. 75-100. doi : 10.1051/ro/2011104. http://www.numdam.org/articles/10.1051/ro/2011104/
[1] , and , Euclidean distortion and the sparsest cut, in STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. ACM New York, NY, USA (2005) 553-562. | MR | Zbl
[2] , and , Expander flows, geometric embeddings and graph partitioning, in STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. ACM, New York, NY, USA (2004) 222-231. | MR | Zbl
[3] , and , A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique. ACM Journal of Experimental Algorithmics 10 (2005) 2.11. | MR | Zbl
[4] , and , Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut, in SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics Philadelphia, PA, USA (2005) 102-111. | MR | Zbl
[5] , , , and , On the hardness of approximating multicut and sparsest-cut, in 20th Annual IEEE Conference on Computational Complexity (2005) 144-153. | MR | Zbl
[6] , , and , Integrality gaps for sparsest cut and minimum linear arrangement problems, in STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. ACM Press, New York, NY, USA (2006) 537-546. | MR | Zbl
[7] , Semidefinite Cuts and Partial Convexification Techniques with Applications to Continuous Nonconvex Optimization, Stochastic Integer Programming, and Facility Layout Problems. Ph.D. thesis, Virginia Polytechnic Institute (2001).
[8] and , Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the Association for Computing Machinery 42 (1995) 1115-1145. | MR | Zbl
[9] , Semidefinite programming for combinatorial optimization. Habilitationsschrift. ZIB-Report ZR-00-34, Konrad-Zuse-Zentrum (2000). | Zbl
[10] and , Semidefinite programming and its applications to approximation algorithms, in Lectures on Proof Verification and Approximation Algorithms (the book grow out of a Dagstuhl Seminar, 1997), Springer-Verlag, London, UK (1998) 263-298.
[11] and , Semi-infinite linear programming approaches to semidefinite programming (SDP) problems, in Novel approaches to hard discrete optimization problems, Fields Institute Communications Series 37. edited by P.M. Pardalos and H. Wolkowicz, AMS (2003) 123-142. | MR | Zbl
[12] and , A unifying framework for several cutting plane methods for semidefinite programming. Optim. Methods Softw. 21 (2006) 57-74. | MR | Zbl
[13] and , A semidefinite programming based polyhedral cut-and-price approach for the maxcut problem. Comput. Opt. Appl. 33 (2006) 51-71. | MR | Zbl
[14] and , Semidefinite programming and integer programming, in Handbook on Discrete Optimization, edited by K. Aardal, G. Nemhauser and R. Weismantel. Elsevier B.V. (2005) 393-514. | Zbl
[15] and , An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci., IEEE Computer Society (1988) 422-431.
[16] , Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems. J. Comb. Optim. 5 (2001) 151-166. | MR | Zbl
[17] and , Enhancing rlt relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22 (2002) 233-261. | MR | Zbl
[18] , Cut problems and their application to divide-and-conquer, in Approximation Algorithms for NP-Hard Problems, edited by D. Hochbaum. PWS Publishing (1996) 192-235.
[19] and , Image segmentation with ratio cut. IEEE Trans. Pattern Anal. Mach. Intell. 25 (2003) 675-690.
[20] , SDPA - Semidefinite programming solver (2002), available at: http://grid.r.dendai.ac.jp/sdpa/.
[21] , and , An approximation algorithm for scheduling two parallel machines with capacity constraints. Discrete Appl. Math. 130 (2003) 449-467. | MR | Zbl
Cité par Sources :
