1647 search results - page 24 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
CORR
2011
Springer
13 years 9 days ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
COLOGNETWENTE
2010
13 years 7 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
CIAC
2010
Springer
14 years 2 days ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...