Finding sparser directed spanners

DOI10.4230/LIPIcs.FSTTCS.2010.424zbMath1245.68246OpenAlexW1565009874MaRDI QIDQ2908874

Piotr Berman, Ge Ruan, Sofya Raskhodnikova

Publication date: 29 August 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_9b2c.html

zbMATH Keywords

directed graphsapproximation algorithmsspanners

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Improved Approximation for the Directed Spanner Problem ⋮ Transitive-Closure Spanners: A Survey ⋮ Distributed Spanner Approximation

This page was built for publication: Finding sparser directed spanners