### Abstract

We present the first hot-potato routing algorithm for the n x n mesh whose running time on any quot;hardquot; (i.e., Ω(n)) "many-to-one" batch routing problem is, with high probability, within a polylogarithmic factor of optimal. For any instance I of a batch routing problem, there exists a well-known lower bound LB_{I} based on maximum path length and maximum congestion. If LB_{I} is Ω(n), our algorithm solves I with high probability in time O(LB_{I}·log^{3} n). The algorithm is distributed and greedy, and it makes use of a new routing technique based on multi-bend paths, a departure from paths using a constant number of bends used in prior hot-potato algorithms.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000 |

Pages | 278-285 |

Number of pages | 8 |

DOIs | |

State | Published - 2000 |

Externally published | Yes |

Event | 32nd Annual ACM Symposium on Theory of Computing, STOC 2000 - Portland, OR, United States Duration: May 21 2000 → May 23 2000 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

ISSN (Print) | 0737-8017 |

### Conference

Conference | 32nd Annual ACM Symposium on Theory of Computing, STOC 2000 |
---|---|

Country | United States |

City | Portland, OR |

Period | 5/21/00 → 5/23/00 |

### ASJC Scopus subject areas

- Software

## Fingerprint Dive into the research topics of 'Hard-potato routing'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000*(pp. 278-285). (Proceedings of the Annual ACM Symposium on Theory of Computing). https://doi.org/10.1145/335305.338762