Sciweavers

352 search results - page 24 / 71
» Experimental Analysis of Approximation Algorithms for the Ve...
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
14 years 14 days ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
ESA
2005
Springer
140views Algorithms» more  ESA 2005»
14 years 2 months ago
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
Marcin Bienkowski, Jaroslaw Byrka
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
14 years 2 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
FOCS
2003
IEEE
14 years 2 months ago
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim...
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 9 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...