12519 search results - page 185 / 2504 » Approximation Problems Categories |
185
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
176
click to vote
WASA
2009
Springer
16 years 1 months ago
2009
Springer
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose...
236
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
160
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
173
click to vote
SI3D
2009
ACM
16 years 1 months ago
2009
ACM
We present an extension of recently developed Loop and Schaefer’s approximation of Catmull-Clark surfaces (ACC) for surfaces with creases and corners which are essential for mos...