A nearly linear work, polylog depth parallel algorithm for approximating the Held-Karp bound and the k-ECSS LP, via a new core-sequence MWU framework.
Beating approximation factor two for weighted tree augmentation with bounded costs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
A nearly linear work, polylog depth parallel algorithm for approximating the Held-Karp bound and the k-ECSS LP, via a new core-sequence MWU framework.