182 search results - page 10 / 37 » Simple Generalized Maximum Flow Algorithms |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
While most software defects (i.e., bugs) are corrected and tested as part of the lengthy software development cycle, enterprise software vendors often have to release software pro...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
PADS
1998
ACM
13 years 12 months ago
1998
ACM
In this paper we consider the distributed simulation of queueing networks of FCFS servers with infinite buffers, and irreducible Markovian routing. We first show that for either t...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...