One-sided local crossing minimization is NP-hard for forests of high-degree stars (with tight ETH lower bound), solvable in quadratic time for degree-2 stars, and admits a 3-approximation via median heuristic with tie-breaking.
17 Heather Hulett, Todd G
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
One-Sided Local Crossing Minimization
One-sided local crossing minimization is NP-hard for forests of high-degree stars (with tight ETH lower bound), solvable in quadratic time for degree-2 stars, and admits a 3-approximation via median heuristic with tie-breaking.