Introduces a heavy-edge technique yielding a 1.622k-approximation for n-pairs shortest paths in weighted graphs, better than previous (2k-3) results.
Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Achieves (2k/3)-approximation for girth in weighted graphs in Õ(m + n^{1+2/k}) time for every k≥2, improving prior partial results, plus new fine-grained lower bounds for unweighted girth approximation.
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.
-
Tighter bounds for weighted and unweighted shortest cycle approximation
Achieves (2k/3)-approximation for girth in weighted graphs in Õ(m + n^{1+2/k}) time for every k≥2, improving prior partial results, plus new fine-grained lower bounds for unweighted girth approximation.