Greedy packet scheduling on shortest paths
Journal of Algorithms
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of 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
Theoretical Computer Science - Special issue on parallel computing
Shortest-path routing in arbitrary networks
Journal of Algorithms
The Quickest Transshipment Problem
Mathematics of Operations Research
The complexity of path coloring and call scheduling
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria
SIAM Journal on Computing
Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Direct routing: Algorithms and complexity
Algorithmica
SIAM Journal on Computing
Universal Bufferless Packet Switching
SIAM Journal on Computing
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Multicommodity flows over time: efficient algorithms and complexity
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Throughput maximization for periodic packet routing on trees and grids
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Universal packet routing with arbitrary bandwidths and transit times
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Approximation algorithms for conflict-free vehicle routing
ESA'11 Proceedings of the 19th European conference on Algorithms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
A simpler proof for O(congestion+dilation) packet routing
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
An optimal algorithm for two robots path planning problem on the grid
Robotics and Autonomous Systems
| Hi-index | 0.00 |
Store-and-forward packet routing belongs to the most fundamental tasks in network optimization. Limited bandwidth requires that some packets cannot move to their destination directly but need to wait at intermediate nodes on their path or take detours. In particular, for time critical applications, it is desirable to find schedules that ensure fast delivery of the packets. It is thus a natural objective to minimize the makespan, i.e., the time at which the last packet arrives at its destination. In this paper we present several new ideas and techniques that lead to novel algorithms and hardness results.