Sciweavers

Share
ISAAC
2007
Springer

Algorithms for the Hypergraph and the Minor Crossing Number Problems

9 years 7 months ago
Algorithms for the Hypergraph and the Minor Crossing Number Problems
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We present some complexity results regarding the corresponding edge and node insertion problems. Based on these results, we give the first embedding-based heuristics to tackle both problems and present a short experimental study. Furthermore, we give the first exact ILP formulation for both problems.
Markus Chimani, Carsten Gutwenger
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ISAAC
Authors Markus Chimani, Carsten Gutwenger
Comments (0)
books