Direct routing: Algorithms and complexity-Reference-Cited by-同舟云学术

Direct routing: Algorithms and complexity

Published:2006-05 Issue:1 Volume:45 Page:45-68
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Busch Costas,Magdon-Ismail Malik,Mavronicolas Marios,Spirakis Paul

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-005-1189-3.pdf

Reference32 articles.

1. M. Adler, S. Khanna, R. Rajaraman, and A. Rosén. Time-constrained scheduling of weighted packets on trees and meshes.Algorithmica, 36:123–152, 2003.

2. M. Adler, A. L. Rosenberg, R. K. Sitaraman, and W. Unger. Scheduling time-constrained communication in linear networks. InProceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 269–278, Puerto Vallarta, Mexico, 1998.

3. N. Alon, F. Chung, and R. Graham. Routing permutations on graphs via matching.SIAM Journal on Discrete Mathematics, 7(3):513–530, 1994.

4. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Direct routing on trees. InProceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 98), pages 342–349, 1998.

5. I. Ben-Aroya, D. D. Chinn, and A. Schuster. A lower bound for nearly minimal adaptive and hot potato algorithms.Algorithmica, 21(4):347–376, August 1998.

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

1. The non-stop disjoint trajectories problem;Discrete Optimization;2024-05

2. Bounding Residence Times for Atomic Dynamic Routings;Mathematics of Operations Research;2022-11

3. Competitive Packet Routing with Priority Lists;ACM Transactions on Economics and Computation;2018-02-28

4. Direct Routing Algorithms;Encyclopedia of Algorithms;2016

5. On the Capacity of Bufferless Networks-on-Chip;IEEE Transactions on Parallel and Distributed Systems;2015-02-01