186 search results - page 20 / 38 » The Partial Augment-Relabel Algorithm for the Maximum Flow P... |
127
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
129
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
120
Voted
DAM
2007
15 years 2 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
114
Voted
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
This paper introduces a novel genetic algorithm strategy based on the reuse of chromosomes from previous generations in the creation of offspring individuals. A number of chromoso...
135
Voted
WG
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...