A universal O(n)-size candidate set for infinite-grid ℓp matching yields a randomized exact ĕO(n)-time algorithm for the rectilinear case via sparse min-cost flow.
[VYP+25] Pruek Vanna-iampikul, Junsik Yoon, Chaeryung Park, Gary Yeap, and Sung Kyu Lim
1 Pith paper cite this work, alongside 173 external citations. Polarity classification is still indexing.
1
Pith paper citing it
173
external citations · external index
fields
cs.CG 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Rectilinear Matching to the Integer Grid in Nearly-Linear Time
A universal O(n)-size candidate set for infinite-grid ℓp matching yields a randomized exact ĕO(n)-time algorithm for the rectilinear case via sparse min-cost flow.