An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.
Diameter partitioning.Discrete & Computational Geometry, 1(3):265–276
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
An O(n^2) optimal algorithm for cardinality-constrained diameter partitioning via reduction to bottleneck 2-coloring and tree DP on the maximum spanning tree, with a matching lower bound.