The traveling salesman problem with distances one and two
Mathematics of Operations Research
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The k-traveling repairman problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Minimum Latency Problem Is NP-Hard for Weighted Trees
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
News from the Online Traveling Repairman
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations 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
On Salesmen, Repairmen, Spiders, and Other Traveling Agents
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
News from the online traveling repairman
Theoretical Computer Science - Mathematical foundations of computer science
Nearly deterministic abstractions of Markov decision processes
Eighteenth national conference on Artificial intelligence
The k-traveling repairmen problem
ACM Transactions on Algorithms (TALG)
A new formulation for the Traveling Deliveryman Problem
Discrete Applied Mathematics
Approximation schemes for degree-restricted MST and red-blue separation problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Improved genetic algorithm for minimum latency problem
Proceedings of the 2010 Symposium on Information and Communication Technology
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
Physical search problems with probabilistic knowledge
Artificial Intelligence
| Hi-index | 0.00 |