Maximizing A/P^α over unions of faces in a plane subdivision is weakly NP-hard for α in (1,2] and solvable in pseudopolynomial time for all α>1.
Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , chapter =
1 Pith paper cite this work, alongside 25 external citations. Polarity classification is still indexing.
1
Pith paper citing it
25
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Maximizing A/P^α over unions of faces in a plane subdivision is weakly NP-hard for α in (1,2] and solvable in pseudopolynomial time for all α>1.