An Approximation Algorithm for Manhattan Routing
Name
MIT-LCS-TM-238.pdf
Size
4.75 MB
Format
Adobe PDF
Checksum (MD5)
0f796b53225f472bdf542b8944a1c9dd
Author(s)
Baker, Brenda S.
Bhatt, Sandeep N.
Leighton, Frank Thomson
Date Issued
February 1983
Series/Report no.
MIT-LCS-TM-238
Abstract
Density has long been known to be an important measure of difficulty for Manhattan routing. In this paper, we identify a second important measure of difficulty, which we call flux. We show that flux, like density, is a lower bound on channel width. In addition, we present a linear-time algorithm which routes any multipoint net Manhattan routing problem with density d and flux f in a channel of width 2d+O(f). (For 2-point net, the bound is d+O(f).) Thus we show that Manhattan routing is one of the NP-complete problems for which there is a provably good approximation algorithm.
Persistent DSpace Link
