28 search results - page 3 / 6 » Approximation Algorithms for Disjoint Paths and Related Rout... |
WADS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
FOCS
1995
IEEE
13 years 10 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
INFOCOM
2003
IEEE
13 years 11 months ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
In wireless sensor networks, bandwidth is one of precious resources to multimedia applications. To get more bandwidth, multipath routing is one appropriate solution provided that ...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...