706 search results - page 29 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
ALGORITHMICA
2006
13 years 7 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
CCR
2008
13 years 7 months ago
2008
Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying re...
ICCAD
1995
IEEE
13 years 11 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...