228 search results - page 4 / 46 » Online Routing in Triangulations |
SPAA
2003
ACM
14 years 24 days ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we present a novel flip-chip routing algorithm for package-board co-design. Unlike the previous works that can consider only either free- or pre-assignment routing,...
QOFIS
2004
Springer
14 years 27 days ago
2004
Springer
Traffic engineering capabilities defined in MPLS enables QoS online routing of LSPs. In this paper we address issues of network survivability in online routing. We define a new lin...
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
Many practical routing problems such as BGA, PGA, pin redistribution and test xture routing involve routing with interchangeable pins. These routing problems, especiallypackage la...
TCS
2008
13 years 7 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...