The emergence of sparse spanners and well-separated pair decomposition under anarchy

DOI10.20382/JOCG.V3I1A1zbMATH Open1404.68199OpenAlexW1857045085MaRDI QIDQ2968083FDOQ2968083

Authors:

Publication date: 9 March 2017

Full work available at URL: https://dblp.uni-trier.de/db/journals/jocg/jocg3.html#ZhouG12

Recommendations

• The emergence of sparse spanners and greedy well-separated pair decomposition
• New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners
• On sparse spanners of weighted graphs
• Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
• NEW SPARSENESS RESULTS ON GRAPH SPANNERS

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (6)

• Geometric spanner games
• New constructions of SSPDs and their applications
• The emergence of sparse spanners and greedy well-separated pair decomposition
• New constructions of SSPDs and their applications
• Geometric Spanner Networks
• Local routing in WSPD-based spanners

This page was built for publication: The emergence of sparse spanners and well-separated pair decomposition under anarchy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968083)