Routing and scheduling on a shoreline with release times

Linear Time Approximation Schemes for Vehicle Scheduling

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory

A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Finding an Optimal Path without Growing the Tree

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms

A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times

Information Processing Letters

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times

Discrete Applied Mathematics

Finding an optimal path without growing the tree

Journal of Algorithms

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

Theoretical Computer Science

A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree

Discrete Applied Mathematics

Linear time approximation schemes for vehicle scheduling problems

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden

Minmax subtree cover problem on cacti

Discrete Applied Mathematics

How to collect balls moving in the Euclidean plane

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University

Online Routing Problems: Value of Advanced Information as Improved Competitive Ratios

Transportation Science

Approximating a vehicle scheduling problem with time windows and handling times

Theoretical Computer Science

Discrete online TSP

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management

Minmax subtree cover problem on cacti

Discrete Applied Mathematics

Approximating the minmax subtree cover problem in a cactus

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle

Theoretical Computer Science

Profit-based latency problems on the line

Operations Research Letters

Vehicle routing problems on a line-shaped network with release time constraints

Operations Research Letters