841 search results - page 64 / 169 » Approximability of Minimum AND-Circuits |
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
COCOON
2008
Springer
13 years 12 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
EOR
2002
13 years 10 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...