Packet routing and job-shop scheduling inO(congestion+dilation) steps-Reference-Cited by-同舟云学术

Packet routing and job-shop scheduling inO(congestion+dilation) steps

Published:1994-06 Issue:2 Volume:14 Page:167-186
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Leighton F. T.,Maggs Bruce M.,Rao Satish B.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF01215349.pdf

Reference12 articles.

1. N. Alon: A parallel algorithmic version of the Local Lemma. InProceedings of the 32nd Annual Symposium on Foundations of Computer Science (1991), 586?593.

2. J. Beck: An algorithmic approach to the Lov�sz Local Lemma I.Random Structures and Algorithms, to appear.

3. R. Koch, T. Leighton, B. Maggs, S. Rao, andA. Rosenberg: Work-preserving emulations of fixed-connection networks. InProceedings of the 21st Annual ACM Symposium on Theory of Computing May 1989, 227?240.

4. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, andD. B. Shmoys: Sequencing and scheduling: Algorithms and complexity. Technical Report BS-R8909, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands, June 1989.

5. F. T. Leighton:Introduction to Parallel Algorithms and Architectures: Arrays ? Tree ? Hypercubes. Morgan Kaufmann, San Mateo, CA, 1992.

Cited by 180 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two Exact Algorithms for the Packet Scheduling Problem;Combinatorial Optimization and Applications;2023-12-09

2. Near-Optimal Packet Scheduling in Multihop Networks with End-to-End Deadline Constraints;Proceedings of the ACM on Measurement and Analysis of Computing Systems;2023-12-07

3. Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Secure Computation Meets Distributed Universal Optimality;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

5. Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs;Journal of the ACM;2023-10-11