A polynomial-time approximation framework for diverse near-optimal triangulations is presented, but it implicitly assumes the NP-hard optimum quality is known.
In: 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Computing Diverse and Nice Triangulations
A polynomial-time approximation framework for diverse near-optimal triangulations is presented, but it implicitly assumes the NP-hard optimum quality is known.