A unified approach to approximation algorithms for bottleneck problems

In this paper a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design is investigated. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition, for several of these problems we can show that unless P = NP, there does not exist a polynomial-time algorithm that has a better performance guarantee.

[1]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[2]  Takao Nishizeki,et al.  A Better than "Best Possible" Algorithm to Edge Color Multigraphs , 1986, J. Algorithms.

[3]  George L. Nemhauser,et al.  Easy and hard bottleneck location problems , 1979, Discret. Appl. Math..

[4]  Dorit S. Hochbaum,et al.  When are NP-hard location problems easy? , 1984, Ann. Oper. Res..

[5]  R. G. Parker,et al.  Guaranteed performance heuristics for the bottleneck travelling salesman problem , 1984 .

[6]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[7]  Gary Chartrand,et al.  The square of a block is Hamiltonian connected , 1974 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Karl J. Lieberherr,et al.  Complexity of partial satisfaction , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[10]  D. Hochbaum.  Easy Solutions for the K–Center Problem or the Dominating Set Problem on Random Graphs , 1985 .

[11]  Journal of the Association for Computing Machinery , 1961, Nature.

[12]  Hang Tong Lau.  Finding a hamiltonian cycle in the square of a block , 1980 .

[13]  Jadranka Skorin-Kapov,et al.  Non-linear integer programming: Sensitivity analysis for branch and bound , 1987 .

[14]  Alan Frieze,et al.  An extension of Christofides heuristic to the k-person travelling salesman problem , 1983, Discret. Appl. Math..

[15]  H. Fleischner.  The square of every two-connected graph is Hamiltonian , 1974 .

[16]  David B. Shmoys,et al.  Powers of graphs: A powerful approximation technique for bottleneck problems , 1984, STOC '84.