Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for geometric problems
Approximation algorithms for NP-hard problems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Approximation schemes for minimum latency problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A Randomized Approximation Scheme for Metric MAX-CUT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |