Bounded-diameter minimum-cost graph problems

Theory of Computing Systems

Volumn 41, Issue 4, 2007, Pages 779-794

  Kapoor, Sanjiv ^a   Sarwat, Mohammad ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COSTS; ECONOMIC AND SOCIAL EFFECTS; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

APPROXIMATION FACTOR; APPROXIMATION RATIOS; BICRITERIA APPROXIMATION; BICRITERIA PROBLEMS; DISTRIBUTED IMPLEMENTATION; MULTICAST NETWORK; POLYNOMIAL-TIME ALGORITHMS; TRIANGLE INEQUALITY;

APPROXIMATION ALGORITHMS;

EID: 36849000250     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-006-1305-z     Document Type: Article

References (12)

1. F. auf der Heide, C. Schindelhauer, K. Volbert, and M. Grunewald. Congestion, energy and delay in radio networks. In Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, pages 230-237, 2002.
2. B. Awerbuch, A. Baratz, and D. Peleg. Cost-sensitive analysis of communication protocols. In Proceed-ings of the ACM SIGACT-SIGOPS Symposium on Principles ofDistributed Computing, pages 177-187. Springer-Verlag, New York, 1990.
3. Y. Dodis and S. Khanna. Designing networks with, bounded pairwise distance. In Proceedings of the ACM Symposium on Theory of Computing, pages 750-759, 1999.
4. R. Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17(1):36-42, 1992.
5. J. Ho, D. Lee, C. Chang, and C. Wong. Bounded-diameter spanning tree and related problems. In Proceedings of the ACM Symposium on Computational Geometry, pages 276-282, 1989.
6. L. Jia, R. Rajaraman, and T. Suel. An efficient distributed algorithm for constructing small dominating sets. Distributed Computing, 15(4):193-205, 2002.
7. S. Khuller, B. Raghavachari, and N. Young. Balancing minimum, spanning and shortest path trees. Algorithmica, 14:305-322, 1993.
8. C. Li, S. McCormick, and D. Simchi-Levi. On the minimum-cardinality- bounded -diameter and the rbbounded-cardinality-minimum-diameter edge addition problems. Operations Research Letters, 11:303-308, 1992.
9. M. Marathe, R. Ravi, R. Sundaram, S. Ravi, D. Rosenkrantz, and H. Hunt, III. Bicriteria network design problems. Journal of Algorithms, 28(1):142-171, 1998.
10. J. Naor and B. Schieber. Improved approximations for shallow-light spanning trees. In Proceedings of the IEEE Conference on Foundations of Computer Science, pages 536-541, 1997.
11. C. Phillips. The network inhibition problem. In Proceedings of the ACM Symposium on Theory of Computing, pages 776-785, 1993.
12. A. Warburton. Approximation of pareto optima in multiple-objective, shortest path problems. Operations Research, 35:70-79, 1987.