182 search results - page 4 / 37 » Simple Generalized Maximum Flow Algorithms |
DAGM
2010
Springer
13 years 6 months ago
2010
Springer
The selection of an optical flow method is mostly a choice from among accuracy, efficiency and ease of implementation. While variational approaches tend to be more accurate than lo...
MOR
2000
13 years 5 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
WEA
2007
Springer
13 years 12 months ago
2007
Springer
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
CATS
2006
13 years 7 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
PPSN
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...