Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CAI
1999
Springer

favoriteEmaildiscussreport

67views Information Technology» more CAI 1999»

Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm

13 years 4 months ago

Polynomial Time Manhattan Routing Without Doglegs - a Generalization of Gallai's Algorithm

Download sziami.cs.bme.hu

Endre Boros, András Recski, Tibor Szkaliczk

Real-time Traffic

CAI 1999 | Information Technology |

claim paper

Related Content

» Octilinear redistributive routing in bump arrays

» A fully polynomial time approximation scheme for timing driven minimum cost buffer inserti...

» A faster approximation scheme for timing driven minimum cost layer assignment

» Greedy Routing with Bounded Stretch

» Minimum energy disjoint path routing in wireless adhoc networks

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	CAI
Authors	Endre Boros, András Recski, Tibor Szkaliczki, Ferenc Wettl

Comments (0)