Journal of the ACM Bibliography
Dorit S. Hochbaum and David B. Shmoys. A unified
approach to approximate algorithms for bottleneck problems.
Journal of the ACM, 33(3):533-550, July 1986.
[BibTeX entry]
Selected papers that cite this one
- Moses Charikar, Chandra Chekuri, Tomás Feder, and Rajeev Motwani.
Incremental
clustering and dynamic information retrieval. In Proceedings
of the Twenty-Ninth Annual ACM Symposium on Theory of Computing,
pages 626-635, El Paso, Texas, 4-6 May 1997.
- Shiva Chaudhuri, Naveen Garg, and R. Ravi. The
p-neighbor k-center problem. Information
Processing Letters, 65(3):131-134, 13 February 1998.
- S. O. Krumke. On
a generalization of the p-Center Problem.
Information Processing Letters, 56(2):67-71, 27 October
1995.
- S. O. Krumke, M. V. Marathe, H. Noltemeier, V. Radhakrishnan, S. S.
Ravi, and D. J. Rosenkrantz. Compact location
problems. Theoretical Computer Science, 181(2):379-404,
30 July 1997.
- Gurmeet Singh Manku. A linear time algorithm for
the Bottleneck Biconnected Spanning Subgraph problem.
Information Processing Letters, 59(1):1-7, 8 July 1996.
- Jeffrey Mark Phillips, Abraham P. Punnen, and S. N. Kabadi. A linear time
algorithm for the bottleneck traveling salesman problem on a Halin
graph. Information Processing Letters, 67(2):105-110,
30 July 1998.
Shortcuts: