Analyzing the Held-Karp TSP bound: a monotonicity property with application
Information Processing Letters
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
SIAM Journal on Computing
Worst-case comparison of valid inequalities for the TSP
Mathematical Programming: Series A and B
Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Faster Deterministic Algorithm for Minimum Spanning Trees
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Studies in computational geometry motivated by mesh generation
Studies in computational geometry motivated by mesh generation
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
New Results of Fault Tolerant Geometric Spanners
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximation Results for Kinetic Variants of TSP
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
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
An Improved Algorithm for the Minimum Manhattan Network Problem
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Representing Graph Metrics with Fewest Edges
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
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
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Approximation algorithms for TSP with neighborhoods in the plane
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Finding the best shortcut in a geometric network
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A linear-time approximation scheme for planar weighted TSP
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A subset spanner for Planar graphs,: with application to subset TSP
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Geometric spanners with applications in wireless networks
Computational Geometry: Theory and Applications
A PTAS for TSP with neighborhoods among fat regions in the plane
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Well-separated pair decomposition in linear time?
Information Processing Letters
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Experimental study of geometric t-spanners
Journal of Experimental Algorithmics (JEA)
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry: Theory and Applications
On Euclidean vehicle routing with allocation
Computational Geometry: Theory and Applications
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Approximation schemes for degree-restricted MST and red-blue separation problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Experimental study of geometric t-spanners: a running time comparison
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Proceedings of the twenty-sixth annual symposium on Computational geometry
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Balancing degree, diameter and weight in Euclidean spanners
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Experimental study of geometric t-spanners
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Hardness and approximation of octilinear steiner trees
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An optimal-time construction of sparse Euclidean spanners with tiny diameter
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Spanners, weak spanners, and power spanners for wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online 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
The traveling salesman problem with few inner points
Operations Research Letters
Approximation algorithms for the Euclidean bipartite TSP
Operations Research Letters
Minimum weight 2-edge-connected spanning subgraphs in planar graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A near linear time approximation scheme for steiner tree among obstacles in the plane
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On euclidean vehicle routing with allocation
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Sparse Euclidean Spanners with Tiny Diameter
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |