On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximation Schemes for Geometric NP-Hard Problems: A Survey
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Deploying sensor networks with guaranteed capacity and fault tolerance
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Approximation schemes for degree-restricted MST and red-blue separation problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Deploying sensor networks with guaranteed fault tolerance
IEEE/ACM Transactions on Networking (TON)
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.01 |