Minimum-diameter covering problems
Authors:
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Generalized p-Center problems: Complexity results and approximation algorithmsEuropean Journal of Operational Research, 1997
- Optimal separable partitioning in the planeDiscrete Applied Mathematics, 1995
- Approximating the tree and tour covers of a graphInformation Processing Letters, 1993
- A unified approach to approximation algorithms for bottleneck problemsJournal of the ACM, 1986
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Some Matching Problems for Bipartite GraphsJournal of the ACM, 1978
- Sparse Matrix Techniques1977
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- On Two Problems in the Generation of Program Test PathsIEEE Transactions on Software Engineering, 1976