Scheduling of vehicles in transportation networks

Authors:
Dariusz Kowalski;Zeev Nutov;Michael Segal
Affiliations:
Department of Computer Science, University of Liverpool, Liverpool, UK;Department of Computer Science, The Open University of Israel, Raanana, Israel;Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
Nets4Cars/Nets4Trains'12 Proceedings of the 4th international conference on Communication Technologies for Vehicles
Year:
2012

Citing 15
Cited 0

The complexity of finding two disjoint paths with min-max objective function

Discrete Applied Mathematics
Greedy packet scheduling on shortest paths

Journal of Algorithms
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Greedy Packet Scheduling

SIAM Journal on Computing
On-line routing of real-time messages

Journal of Parallel and Distributed Computing
Distributed packet switching in arbitrary networks

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Universal O(congestion + dilation + log1+&egr;N) local control packet switching algorithms

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling time-constrained communication in linear networks

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling in synchronous networks and the greedy algorithm

Theoretical Computer Science
Efficient Algorithms for k-Disjoint Paths Problems on DAGs

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Minimum Delay Data Gathering in Radio Networks

ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Time optimal gathering in sensor networks

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

Journal of Computer and System Sciences
Packet routing on the grid

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
An approximation algorithm for the wireless gathering problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider online vehicle scheduling problems for different network topologies under various objective functions: minimizing the maximum completion time, minimizing the largest delay, and minimizing the sum of completion times and present a number of provable approximate solutions.