Construction of Minimum-Weight Spanners

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 797-808

  Sigurd, Mikkel ^a   Zachariasen, Martin ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ARBITRARY GRAPHS; EXACT ALGORITHMS; GREEDY ALGORITHMS; METRIC SPACE SEARCHING; MINIMUM SPANNING TREES; PROBLEM INSTANCES; SPARSE SUBGRAPHS; UNDERLYING GRAPHS;

TREES (MATHEMATICS);

EID: 35048835213     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_70     Document Type: Article

References (28)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On Sparse Spanners of Weighted Graphs. Discrete and Computational Geometry, 9:81-100, 1993.
2. Y. P. Aneja, V. Aggarwal, and K. P. K. Nair. Shortest Chain Subject to Side Constraints. Networks, 13:295-302, 1983.
3. L. Cai. NP-Completeness of Minimum Spanner Problem. Discrete Applied Mathematics, 48:187-194, 1994.
4. B. Chandra. Constructing Sparse Spanners for Most Graphs in Higher Dimension. Information Processing Letters, 51:289-294, 1994.
5. B. Chandra, G. Das, G. Narasimhan, and J. Soares. New Sparseness Results on Graph Spanners. International Journal of Computational Geometry and Applications, 5:125-144, 1995.
6. G. Das and G. Narasimhan. A Fast Algorithm for Constructing Sparse Euclidean Spanners. Int. J. Comput. Geometry Appl., 7(4):297-315, 1997.
7. G. Das, G. Narasimhan, and J.S. Salowe. A New Way to Weigh Malnourished Euclidean Graphs. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 215-222, 1995.
8. M. Desrochers and F. Soumis. A Generalized Permanent Labelling Algorithm for the Shortest Path Problem with Time Windows. INFOR, 26:191-211, 1988.
9. Y. Dodis and S. Khanna. Design Networks with Bounded Pairwise Distance. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing, pages 750-759, 1999.
10. D. Eppstein. Spanning Trees and Spanners. In Handbook of Computational Geometry, pages 425-461, 1999.
11. A. M. Parley, D. Zappala A. Proskurowski, and K. Windisch. Spanners and Message Distribution in Networks. Discrete Applied Mathematics, 137:159-171, 2004.
12. M. R. Garey and D. S. Johnson. Computers and Intractability. W.H.Freeman and Co., San Francisco, 1979.
13. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. SIAM Journal on Computing, 31 (5):1479-1500, 2002.
14. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate Distance Oracles for Geometric Graphs. In Proceedings of the 13th Annual ACMSIAM Symposium on Discrete Algorithms, pages 828-837, 2002.
15. G. Y. Handler and I. Zang. A Dual Algorithm for the Constrained Shortest Path Problem. Networks, 10:293-310, 1980.
16. ILOG. ILOG CPLEX 7.0, Reference Manual. ILOG, S.A., France, 2000.
17. H.C. Joksch. The Shortest Route Problem with Constraints. J. Math. Anal. Appl., 14:191-197, 1966.
18. S. Khuller, B. Raghavachari, and N. Young. Balancing Minimum Spanning and Shortest-Path Trees. Algorithmica, 14(4):305-321, 1995.
19. G. Narasimhan and M. Zachariasen. Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. ACM Journal of Experimental Algorithmics, 6, 2001.
20. G. Navarro and R. Paredes. Practical Construction of Metric t-Spanners. In Proceedings of the 5th Workshop on Algorithm Engineering and Experiments (ALENEX'03), 2003.
21. G. Navarro, R. Paredes, and E. Chavez. t-Spanners as a Data Structure for Metric Space Searching. In International Symposium on String Processing and Information Retrieval, SPIRE, LNCS 2476, pages 298-309, 2002.
22. D. Peleg and A. Schaffer. Graph Spanners. Journal of Graph Theory, 13(1): 99-116, 1989.
23. S. B. Rao and W. D. Smith. Improved Approximation Schemes for Geometrical Graphs via "Spanners" and "Banyans". In Proceedings 30th Annual ACM Symposium on Theory of Computing, pages 540-550, 1998.
24. M. Sigurd and D. Ryan. Stabilized Column Generation for Set Partitioning Optimization. In preparation, 2003.
25. S. Thienel. ABACUS - A Branch-And-CUt System. PhD thesis, Universität zu Köln, Germany, 1995.
26. A. Warburton. Approximation of Pareto Optima in Multiple-Objective, Shortest Path Problems. Operations Research, 35:70-79, 1987.
27. B. M. Waxman. Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications, 6(9):1617-22, 1988.
28. M. Ziegelmann. Constrained Shortest Paths and Related Problems. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, 2001.