The 2-MDCC problem admits a polynomial-time algorithm via reduction to a quadratic number of bounded subset-sum instances solvable by dynamic programming.
The maximum dispersion problem
2 Pith papers cite this work, alongside 22 external citations. Polarity classification is still indexing.
2
Pith papers citing it
22
external citations · Crossref
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
The 2-MDCC problem admits a polynomial-time algorithm via reduction to a quadratic number of bounded subset-sum instances solvable by dynamic programming.
-
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.