4894 search results - page 155 / 979 » The Guarding Problem - Complexity and Approximation |
179
click to vote
WADS
2007
Springer
16 years 16 days ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
176
click to vote
WAOA
2007
Springer
16 years 16 days ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
163
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a new estimator for counting the number of solutions of a Boolean satisfiability problem as a part of an importance sampling framework. The estimator uses the recently...
189
click to vote
ORL
2008
15 years 6 months ago
2008
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
205
click to vote
TIP
2002
15 years 6 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...