Approximation algorithms for maximum dispersion
- 31 October 1997
- journal article
- Published by Elsevier BV in Operations Research Letters
- Vol. 21 (3), 133-137
- https://doi.org/10.1016/s0167-6377(97)00034-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Comments on the Paper: ‘Heuristic and Special Case Algorithms for Dispersion Problems’ by S. S. Ravi, D. J. Rosenkrantz, and G. K. TayiOperations Research, 1998
- Computational aspects of the maximum diversity problemOperations Research Letters, 1996
- Heuristic and Special Case Algorithms for Dispersion ProblemsOperations Research, 1994
- Obnoxious Facility Location on GraphsSIAM Journal on Discrete Mathematics, 1991
- A class of bounded approximation algorithms for graph partitioningNetworks, 1990
- An Analysis of the Greedy Heuristic for Independence SystemsAnnals of Discrete Mathematics, 1978
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Time bounds for selectionJournal of Computer and System Sciences, 1973