4843 search results - page 355 / 969 » The Shortcut Problem - Complexity and Approximation |
148
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
158
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
117
click to vote
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
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...
127
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
142
click to vote
AAAI
1998
15 years 5 months ago
1998
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...