A unified approach to approximation algorithms for bottleneck problems

Journal of the ACM (JACM)

Volumn 33, Issue 3, 1986, Pages 533-550

  Hochbaum, Dorit S ^a   Shmoys, David B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TELECOMMUNICATION SYSTEMS - DESIGN;

APPROXIMATION ALGORITHMS; BOTTLENECK PROBLEMS; NP-COMPLETENESS; WORST-CASE ANALYSIS;

COMPUTER PROGRAMMING;

EID: 0022753024     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/5925.5933     Document Type: Article

References (16)

1. AHO, A. V., HOPCROFT, J. E., and ULLMAN, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Pa., 1974, pp. 179-187.]
2. CHARTRAND, G., HOBBS, A. M., JUNG, H. A., KAPOOR, S. F., and NASH-WILLIAMS, C. ST. J.A. The square of a block is Hamiltonian connected. J. Comb. Theory, Set. B 16 (1974) 290-292.]
3. CHRISTOFIDES, N. Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegie-Mellon Univ., Pittsburgh, Pa., 1976.]
4. FLEISCHNER, H. The square of every two-connected graph is Hamiltonian. J. Comb. Theory, Set. B 16 (1974), 29-34.]
5. FRIEZE, A.M. An extension of Christofides heuristic to the k-person travelling salesman problem. Discr. Appl. Math. 6 (1983), 79-83.]
6. GAREY, M. R. and JOHNSON, D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.]
7. GONZALEZ, T. F’. Clustering to minimize the maximum inter-city distance. Tech. Rep. 117, Computer Science Dept., Univ. of Texas, Dallas, 1982.]
8. HOCHBAUM, D.S. When are NP-hard location problems easy? Ann. Oper. Res. I (1984), 201- 214.]
9. HOFHBAUM, D.S. Easy Solutions for the k-Center Problem or the Dominating Set Problem on Random Graphs. Ann. Disc. Math. 25 (1985), 189-210.]
10. HOCHBAUM, D. S., AND SHMOYS, D.B. Powers of graphs: A powerful approximation algorithm technique for bottleneck problems. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing (Washington, DC, Apr. 30-May 2). ACM, New York, I984, pp. 324-333.]
11. HOCHBAUM, O. S., NISHIZEKI, T., AND SHMOYS, D.B. A better than “best possible” algorithm to edge color m ultigraphs. J. Algorithms, to appear.]
12. Hsu, W. L., AND NEMHAUSER, G.L. Easy and hard bottleneck location problems. Disc. Appl. Math. 1 (1979), 209-216.]
13. LAU, H.T. Finding a Hamiltonian cycle in the square of a block. Ph.D. dissertation, McGill Univ., Montreal, Que., Canada, 1980.]
14. LIEBERHERR, K. J., AND SPECKER, E. Complexity of partial satisfaction. J. ACM 28, 2 (Apr. 198 l), 411-421.]
15. NISHIZEKI, T., AND SATO, M. An approximation algorithm for edge-coloring multigraphs. Preprint.]
16. PARKER, R. G., AND RARDIN, R.L. Guaranteed performance heuristic for the bottleneck travelling salesman problem. Oper. Res. Lett. 6 (1982), 269-272.]