An exact Õ(n^{1.5} log Δ) algorithm for minimum total-length many-to-many matching on integer-coordinate points in [Δ]^2, the first subquadratic result for the problem.
3.Augmentation.Augment ˜Malong the augmenting paths inP
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
An exact Õ(n^{1.5} log Δ) algorithm for minimum total-length many-to-many matching on integer-coordinate points in [Δ]^2, the first subquadratic result for the problem.