Path coloring on the mesh
- 23 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 400-409
- https://doi.org/10.1109/sfcs.1996.548499
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Throughput-competitive on-line routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On-line admission control and circuit routing for high performance computing and communicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast algorithms for finding O(congestion+dilation) packet routing schedulesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximations for the disjoint paths problem in high-diameter planar networksPublished by Association for Computing Machinery (ACM) ,1995
- Existence and Construction of Edge-Disjoint Paths on Expander GraphsSIAM Journal on Computing, 1994
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse CutsSIAM Journal on Computing, 1994
- On-line load balancing with applications to machine scheduling and virtual circuit routingPublished by Association for Computing Machinery (ACM) ,1993
- A parallel algorithmic version of the local lemmaRandom Structures & Algorithms, 1991
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991