13 search results - page 2 / 3 » A General Framework for Designing Approximation Schemes for ... |
STOC
1995
ACM
13 years 9 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
CORR
2010
Springer
13 years 15 days ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
INFORMS
1998
13 years 5 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
ACMICEC
2006
ACM
13 years 11 months ago
2006
ACM
As third party logistic services become popular, the role of software agents increases in importance in terms of the logistics scheduling of buyers and sellers. To support many mo...