Affiliation:
1. Univ. of California, Berkeley, Berkeley
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference15 articles.
1. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading;AHO A. V.;Pa.,1974
2. The square of a block is Hamiltonian connected. J. Comb. Theory;CHARTRAND G.;Set. B,1974
3. The square of every two-connected graph is Hamiltonian. J. Comb. Theory;FLEISCHNER H;Set. B,1974
4. An extension of Christofides heuristic to the k-person travelling salesman problem;FRIEZE A.M;Discr. Appl. Math.,1983
Cited by
196 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献