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...
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...
Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
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...
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...
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...