The traveling salesman problem with distances one and two
Mathematics of Operations Research
Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
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)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A 5/4-approximation algorithm for minimum 2-edge-connectivity
SODA '03 Proceedings of the fourteenth 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
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Hardness of Approximation for Vertex-Connectivity Network-Design Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On k-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On k-edge-connectivity problems with sharpened triangle inequality
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Approximation schemes for capacitated geometric network design
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A 5/4-approximation algorithm for biconnecting a graph with a given hamiltonian path
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Minimum weight 2-edge-connected spanning subgraphs in planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.02 |