A faster implementation of the Goemans-Williamson clustering algorithm
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Primal-dual approaches to the Steiner problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A fast algorithm for computing steiner edge connectivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
Information Processing Letters
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.89 |