The delivery man problem on a tree network
Annals of Operations Research
Analyzing the Held-Karp TSP bound: a monotonicity property with application
Information Processing Letters
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
Survivable networks, linear programming relaxations and the parsimonious property
Mathematical Programming: Series A and B
Information and Computation
The delivery man problem and cumulative matroids
Operations Research
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
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
A constant-factor approximation for the k-MST problem in the plane
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
P-Complete Approximation Problems
Journal of the ACM (JACM)
A constant-factor approximation algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Asymmetric rendezvous on the plane
Proceedings of the fourteenth annual symposium on Computational geometry
Approximation schemes for minimum latency problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Minimizing wirelength in zero and bounded skew clock trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New and improved algorithms for minsum shop scheduling
SODA '00 Proceedings of the eleventh 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
Building Edge-Failure Resilient Networks
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
On Salesmen, Repairmen, Spiders, and Other Traveling Agents
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
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
Resource optimization in QoS multicast routing of real-time multimedia
IEEE/ACM Transactions on Networking (TON)
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
Approximating the k-traveling repairman problem with repairtimes
Journal of Discrete Algorithms
The k-traveling repairmen problem
ACM Transactions on Algorithms (TALG)
On the power of lookahead in on-line server routing problems
Theoretical Computer Science
A new formulation for the Traveling Deliveryman Problem
Discrete Applied Mathematics
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
The stochastic machine replenishment problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Improved genetic algorithm for minimum latency problem
Proceedings of the 2010 Symposium on Information and Communication Technology
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Secretary problems via linear programming
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Operations Research Letters
Physical search problems with probabilistic knowledge
Artificial Intelligence
| Hi-index | 0.00 |