Data structures and network algorithms
Data structures and network algorithms
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Hamming Clustering Problems
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Asymmetry in k-center variants
Theoretical Computer Science - Approximation and online algorithms
Asymmetric k-center with minimum coverage
Information Processing Letters
| Hi-index | 0.00 |