A heuristic for bottleneck crossing minimization and its performance on general crossing minimization

DOI10.1145/2133803.2212314zbMath1284.68528OpenAlexW2117323000MaRDI QIDQ5406259

Matthias F. M. Stallmann

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2133803.2212314

zbMATH Keywords

crossing minimizationbarycenter heuristicsifting heuristic

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

A variable depth neighborhood search algorithm for the min-max arc crossing problem ⋮ Tabu search for min-max edge crossing in graphs

This page was built for publication: A heuristic for bottleneck crossing minimization and its performance on general crossing minimization