Weighted Additive Spanners
Weighted Additive Spanners
复制标题
加权附加扳手
DOI:
10.1007/978-3-030-60440-0_32
复制
发表时间:
2020
期刊:
影响因子:
--
通讯作者:
Spence, R
中科院分区:
文献类型:
--
作者:
Ahmed, R;Bodwin, G;Darabi, F;Kobourov, S;Spence, R
Aspannerof a graphGis a subgraphHthat approximately preserves shortest path distances inG. Spanners are commonly applied to compress computation on metric spaces corresponding to weighted input graphs. Classic spanner constructions can seamlessly handle edge weights, so long as error is measuredmultiplicatively. In this work, we investigate whether one can similarly extend constructions of spanners with purelyadditiveerror to weighted graphs. These extensions are not immediate, due to a key lemma about the size of shortest path neighborhoods that fails for weighted graphs. Despite this, we recover a suitable amortized version, which lets us prove direct extensions of classicandunweighted spanners (both all-pairs and pairwise) toandweighted spanners, whereWis the maximum edge weight. Specifically, we show that a weighted graphGcontains all-pairs (pairwise)andweighted spanners of sizeand(and) respectively. For a technical reason, theunweighted spanner becomes aweighted spanner; closing this error gap is an interesting remaining open problem. That is, we show thatGcontains all-pairs (pairwise)weighted spanners of size().
登录
查看更多内容
DOI:
--
发表时间:
2013
期刊:
ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
S. Chechik
通讯作者:
S. Chechik
影响因子:
1.3
作者:
Bodwin, Greg;Williams, Virginia Vassilevska
通讯作者:
Williams, Virginia Vassilevska
DOI:
--
发表时间:
2010
期刊:
International Colloquium on Automata, Languages and Programming
影响因子:
--
作者:
David P. Woodruff
通讯作者:
David P. Woodruff
DOI:
10.1145/380752.380797
发表时间:
2001-07
期刊:
--
影响因子:
--
作者:
Michael Elkin;D. Peleg
通讯作者:
Michael Elkin;D. Peleg
DOI:
10.1145/3088511
发表时间:
2015
期刊:
Journal of the ACM (JACM)
影响因子:
--
作者:
Amir Abboud;Gregory Bodwin
通讯作者:
Gregory Bodwin