An SDP Approach to multi-level crossing minimization

2011 Proceedings of the 13th Workshop on Algorithm Engineering and Experiments, ALENEX 2011

Volumn , Issue , 2011, Pages 116-126

  Chimani, Markus ^a   Hungerlander, Philipp ^b   Jünger, Michael ^c   Mutzel, Petra ^d  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF KLAGENFURT   (Austria)

^c UNIVERSITY OF COLOGNE   (Germany)

^d TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMAL SYSTEMS; RAILROAD CROSSINGS;

BRANCH AND CUT; EXACT ALGORITHMS; GRAPH'S VERTICES; INTEGER LINEAR PROGRAMMING; LAYERED GRAPHS; OPTIMAL SOLUTIONS; SEMI-DEFINITE PROGRAM (SDP); STATE OF THE ART;

GRAPH THEORY;

EID: 84880340298     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972917.12     Document Type: Conference Paper

References (30)

1. M. F. Anjos and A. Vannelli. Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes. INFORMS Journal On Computing, 20(4):611-617, 2008.
2. C. Buchheim, A. Wiegele, and L. Zheng. Exact Algorithms for the Quadratic Linear Ordering Problem. INFORMS Journal On Computing, pages 168-177, 2009.
3. M. Chimani, C. Gutwenger, P. Mutzel, and H.-M. Wong. Layer-free upward crossing minimization. ACM Journal of Experimental Algorithmics, 15, 2010.
4. M. Chimani, C. Gutwenger, P. Mutzel, and H.-M.Wong. Upward planarization layout. In Proceedings of the Symposium on Graph Drawing [GD'09], volume 5849 of LNCS, pages 94-106. Springer, 2010.
5. G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, and L. Vismara. Drawing directed acyclic graphs: An experimental study. International Journal of Computational Geometry and Applications, 10(6):623648, 2000.
6. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications, 7(5-6):303-325, 1997.
7. V. Dujmović, H. Fernau, and M. Kaufmann. Fixed parameter algorithms for one-sided crossing minimization revisited. J. of Discrete Algorithms, 6(2):313-323, 2008.
8. P. Eades and N. C. Wormald. Edge crossings in drawings of bipartite graphs. Algorithmica, 11(4):379-403, 1994.
9. M. Eiglsperger, M. Kaufmann, and F. Eppinger. An approach for mixed upward planarization. Journal of Graph Algorithms and Applications, 7(2):203-220, 2003.
10. I. Fischer, G. Gruber, F. Rendl, and R. Sotirov. Computational experience with a bundle method for semidefinite cutting plane relaxations of max-cut and equipartition. Mathematical Programming, 105:451-469, 2006.
11. G. Gange, P. J. Stuckey, and K. Marriott. Optimal k-level planarization and crossing minimization. In Proceedings of the Symposium on Graph Drawing [GD'10], LNCS. Springer, 2010. to appear.
12. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19(3):214-230, 1993.
13. M. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:11151145, 1995.
14. Graphviz gallery, http://www.graphviz.org/Gallery.php, Oktober2010.
15. P. Healy and A. Kuusik. The vertex-exchange graph: A new concept for multilevel crossing minimisation. In Proceedings of the Symposium on Graph Drawing [GD'99], volume 1731 of LNCS, pages 205-216. Springer, 1999.
16. P. Healy and A. Kuusik. The vertex-exchange graph and its use in multi-level graph layout. Technical Report UL-CSIS99-1, Department of Computer Science and Information Systems, University of Limerick, Ireland, 1999.
17. C. Helmberg. Fixing variables in semidefinite relaxations. SIAM Journal on Matrix Analysis and Applications, 21(3):952-969, 2000.
18. C. Helmberg, F. Rendl, R. Vanderbei, and H. Wolkowicz. An interior-point method for semidefinite programming. SIAM Journal on Optimization, 6:342-361, 1996.
19. P. Hungerländer. Algorithms and Applications for Convex Optimization. PhD thesis, Alpen-Adria Universiẗat Klagenfurt, 2010.
20. P. Hungerländer and F. Rendl. Semidefinite relaxations of ordering problems. Submitted; preprint available at http://www.optimizationonline.org/ DBHTML/2010/08/2696.html, 2010.
21. M. Jünger, E. K. Lee, P. Mutzel, and T. Odenthal. A polyhedral approach to the multi-layer crossing minimization problem. In Proceedings of the Symposium on Graph Drawing [GD'97], volume 1353 of LNCS, pages 13-24. Springer, 1997.
22. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications, 1:1-25, 1997.
23. L. Lovász and A. Schrijver. Cones of matrices and setfunctions and 0-1 optimization. SIAM Journal on Optimization, 1:166-190, 1991.
24. R. Martí and M. Laguna. Heuristics and meta-heuristics for 2-layer straight line crossing minimization. Discrete Applied Mathematics, 127(3):665-678, 2003.
25. M. May and K. Szkatula. On the bipartite crossing number. Control and Cybernetics, 72:85-97, 1988.
26. F. Rendl, G. Rinaldi, and A. Wiegele. Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Mathematical Programming, 212:307-335, 2010.
27. H. D. Sherali and W. P. Adams. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics, 3(3):411-430, 1990.
28. F. Shieh and C. McCreary. Directed graphs drawing by clanbased decomposition. In Proceedings of the Symposium on Graph Drawing [GD'95], volume 1027 of LNCS, pages 472482. Springer, 1996.
29. C. D. Simone. The cut polytope and the Boolean quadric polytope. Discrete Mathematics, 79(1):71-75, 1990.
30. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109-125, 1981.