572 search results - page 54 / 115 » Exponential-Time Approximation of Hard Problems |
134
click to vote
CORR
2011
Springer
14 years 6 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...
176
click to vote
OL
2011
14 years 9 months ago
2011
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
168
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
167
click to vote
STOC
2012
ACM
13 years 5 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
127
Voted
AIIA
2009
Springer
15 years 7 months ago
2009
Springer
In this paper a planning framework based on Ant Colony Optimization techniques is presented. Optimal planning is a very hard computational problem which has been coped with differe...