An SDP approach to multi-level crossing minimization
DOI10.1145/2133803.2330084zbMath1284.90047OpenAlexW1978394966MaRDI QIDQ5406272
Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
Publication date: 1 April 2014
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: http://e-archive.informatik.uni-koeln.de/616/2/zaik2011-616.pdf
Semidefinite programming (90C22) Integer programming (90C10) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Uses Software
This page was built for publication: An SDP approach to multi-level crossing minimization