The delivery man problem on a tree network
Annals of Operations Research
A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The traveling salesman problem with distances one and two
Mathematics of Operations Research
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
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 algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Graph learning with a nearest neighbor approach
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
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
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Shortest path in complete bipartite digraph problem and its applications
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Query strategies for priced information (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On-line single-server dial-a-ride problems
Theoretical 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
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
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
Minimum Back-Walk-Free Latency Problem
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
Query strategies for priced information
Journal of Computer and System Sciences - Special issue on STOC 2000
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Exact algorithms for the minimum latency problem
Information Processing Letters
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Playing games in many possible worlds
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
OMNI: an efficient overlay multicast infrastructure for real-time applications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Approximating the k-traveling repairman problem with repairtimes
Journal of Discrete Algorithms
The k-traveling repairmen problem
ACM Transactions on Algorithms (TALG)
Computing Phylogenetic Diversity for Split Systems
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Directed Minimum Latency Problem
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Disseminating streaming data in a dynamic environment: an adaptive and cost-based approach
The VLDB Journal — The International Journal on Very Large Data Bases
A new formulation for the Traveling Deliveryman Problem
Discrete Applied Mathematics
An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Cross-tree adjustment for spatialized audio streaming over networked virtual environments
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
OMNI: An efficient overlay multicast infrastructure for real-time applications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Multi-robot routing with linear decreasing rewards over time
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Exact algorithms for the minimum latency problem
Information Processing Letters
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Improved genetic algorithm for minimum latency problem
Proceedings of the 2010 Symposium on Information and Communication Technology
Asymmetric traveling salesman path and directed latency problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Approximation algorithms for optimal decision trees and adaptive TSP problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Branch and bound algorithm for a single vehicle routing problem with toll-by-weight scheme
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Dynamic Vehicle Routing with Priority Classes of Stochastic Demands
SIAM Journal on Control and Optimization
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
The machine learning and traveling repairman problem
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
An approximation algorithm for the minimum latency set cover problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
The general message ferry route (MFR*) problem and the An-Improved-Route (AIR) scheme
Computer Networks: The International Journal of Computer and Telecommunications Networking
Profit-based latency problems on the line
Operations Research Letters
The Delivery Man Problem with time windows
Discrete Optimization
Operations Research Letters
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |