A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Discrete & Computational Geometry
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Handbook of discrete and computational geometry
A 2.5-factor approximation algorithm for the k-MST problem
Information Processing Letters
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete 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 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for time-dependent orienteering
Information Processing Letters
Approximation Algorithms for Time-Dependent Orienteering
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The orienteering problem in the plane revisited
Proceedings of the twenty-second annual symposium on Computational geometry
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Iterated local search for the team orienteering problem with time windows
Computers and Operations Research
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A Path Relinking approach for the Team Orienteering Problem
Computers and Operations Research
To fill or not to fill: the gas station problem
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Algorithmics in intensity-modulated radiation therapy
Algorithms and theory of computation handbook
To fill or not to fill: The gas station problem
ACM Transactions on Algorithms (TALG)
Minimum vehicle routing with a common deadline
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Shape rectangularization problems in intensity-modulated radiation therapy
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms (TALG)
The Multiconstraint Team Orienteering Problem with Multiple Time Windows
Transportation Science
A two-stage approach to the orienteering problem with stochastic weights
Computers and Operations Research
| Hi-index | 0.00 |