Two new algorithms, AugmentedGreedy and RandomizedRounding, give the first unconditional m-approximation and a simple O(n log n)-approximation for the most general decoupled freeform spanner problem.
On additive span- ners in weighted graphs with local error
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Simple Approximations for General Spanner Problems
Two new algorithms, AugmentedGreedy and RandomizedRounding, give the first unconditional m-approximation and a simple O(n log n)-approximation for the most general decoupled freeform spanner problem.