448 search results - page 15 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
FSTTCS
1999
Springer
14 years 28 days ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
APPROX
2007
Springer
14 years 20 days ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
ICCSA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
ICVS
2009
Springer
14 years 3 months ago
2009
Springer
The faithful detection of the motion and of the distance of the objects in the visual scene is a desirable feature of any artificial vision system designed to operate in unknown e...
ORL
1998
13 years 8 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...