56 search results - page 1 / 12 » Local approximation algorithms for a class of 0 1 max-min li... |
SPAA
2009
ACM
14 years 6 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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
SODA
2001
ACM
13 years 6 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
SCL
2011
12 years 8 months ago
2011
The fact that the heat equation is controllable to zero in any bounded domain of the euclidean space, any time T > 0 and from any open subset of the boundary is well known. On ...
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
13 years 13 days ago
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...