(1+ε, β)-spanner constructions for general graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 173-182

  Elkin, M ^a   Peleg, D ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; POLYNOMIALS;

SPANNER CONSTRUCTIONS;

GRAPH THEORY;

EID: 0034826711     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380797     Document Type: Conference Paper

References (22)

1. On sparse spanners of weighted graphs
2. Sparse partitions
3. On the red-blue set cover problem
4. New sparseness results on graph spanners
5. There is a planar graph almost as good as the complete graph
6. Delaunay graphs are almost as good as complete graphs
7. All pairs almost shortest paths
8. Designing networks with bounded pairwise distance
9. The hardness of approximating spanner problems
10. Strong inapproximability of the basic k-spanner problem
11. On the hardness of approximating spanners
12. Generating sparse 2-spanners
13. On the minimum-cardinality-bounded-diameter and bounded-cardinality-minimum-diameter edge addition problems
14. Grid spanners
15. Graph spanners
16. An optimal synchronizer for the hypercube
17. 10' s