Simple approximations for general spanner problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A simple efficient approximation scheme for the restricted shortest path problem
- Additive spanners: a simple construction
- Algorithms – ESA 2004
- Approximating spanners and directed Steiner forest. Upper and lower bounds
- Approximation algorithms for directed weighted spanners
- Approximation algorithms for nonuniform buy-at-bulk network design
- Bundling-aware graph drawing
- Design networks with bounded pairwise distance
- Directed spanners via flow-based linear programs
- Generating Sparse 2-Spanners
- Graph spanners
- Graph theoretic concepts in computer science. 25th international workshop, WG '99, Ascona, Switzerland, June 17--19, 1999. Proceedings
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
- Light spanners
- Network design problems with bounded distances via shallow-light Steiner trees
- On sparse spanners of weighted graphs
- On strong NP-completeness of rational problems
- On the hardness of approximating spanners
- Spanner approximations in practice
- Sparse Sourcewise and Pairwise Distance Preservers
- The hardness of approximating spanner problems
- Using light spanning graphs for passenger assignment in public transport
This page was built for publication: Simple approximations for general spanner problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860278)
