A Local Algorithm for Constructing Spanners in Minor-Free Graphs

Levi, Reut; Ron, Dana; Rubinfeld, Ronitt

doi:10.4230/LIPIcs.APPROX-RANDOM.2016.38

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

A Local Algorithm for Constructing Spanners in Minor-Free Graphs

MPS-Authors

/persons/resource/persons199710

Levi, Reut
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2016/6661/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Levi, R., Ron, D., & Rubinfeld, R. (2016). A Local Algorithm for Constructing Spanners in Minor-Free Graphs. In K. Jansen, C. Mathieu, J. D. P. Rolim, & C. Umans (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (pp. 1-15). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX-RANDOM.2016.38.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-5FE0-8

Abstract

There is no abstract available