1172 search results - page 153 / 235 » Path Algorithms on Regular Graphs |
143
click to vote
ALGORITHMICA
2006
15 years 2 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)...
144
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
166
Voted
VLSID
2002
IEEE
15 years 7 months ago
2002
IEEE
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
106
click to vote
PARELEC
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
132
click to vote
WADS
2001
Springer
15 years 7 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...