For the problem of adding k edges to a metric graph to minimize average dilation, a greedy algorithm obtains at least 1/(8k) of the optimal benefit.
Finding the best shortcut in a geometric network
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improving the average dilation of a metric graph by adding edges
For the problem of adding k edges to a metric graph to minimize average dilation, a greedy algorithm obtains at least 1/(8k) of the optimal benefit.