Introduces a heavy-edge technique yielding a 1.622k-approximation for n-pairs shortest paths in weighted graphs, better than previous (2k-3) results.
Improved girth approximation in weighted undirected graphs , booktitle =
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
-
Improved Approximation Algorithms for n-Pairs Shortest Paths
Introduces a heavy-edge technique yielding a 1.622k-approximation for n-pairs shortest paths in weighted graphs, better than previous (2k-3) results.