182 search results - page 11 / 37 » Simple Generalized Maximum Flow Algorithms |
105
Voted
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
82
Voted
TSP
2010
14 years 4 months ago
2010
The adaptive estimation of a time-varying parameter vector in a linear Gaussian model is considered where we a priori know that the parameter vector belongs to a known arbitrary s...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
In this paper, we present a general framework to discover spatial associations and spatio-temporal episodes for scientific datasets. In contrast to previous work in this area, fea...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
STOC
2006
ACM
15 years 9 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...