Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
A probabilistic analysis of the switching algorithm for the Euclidean TSP
Mathematical Programming: Series A and B
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On-line Steiner trees in the Euclidean plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A priori inequalities for the Euclidean traveling salesman
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Worst-case bounds for subadditive geometric graphs
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On local search and placement of meters in networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
| Hi-index | 0.00 |