Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding a hamiltonian cycle in the square of a block
Finding a hamiltonian cycle in the square of a block
A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
The complexity of data mining on the Web
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The optimal placement of replicas in a network using a READ ANY - WRITE ALL policy
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
A simple heuristic for the p-centre problem
Operations Research Letters
The fault tolerant capacitated k-center problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
In this paper we investigate 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. 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&eqil;NP, there does not exist a polynomial-time algorithm that has a better performance guarantee.