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.
27 Marcus Schaefer
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
representative citing papers
DREAMS is a new modeling prototype that cuts time for creating and revising DRM Reference and Impact Models compared to manual methods, shown in a small study with four users.
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.
-
DREAMS: Modelling Support for Research into Engineering and Artistic Design
DREAMS is a new modeling prototype that cuts time for creating and revising DRM Reference and Impact Models compared to manual methods, shown in a small study with four users.