3875 search results - page 159 / 775 » Approximation algorithms for the 0-extension problem |
146
click to vote
WASA
2009
Springer
15 years 11 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...
157
Voted
JMLR
2010
14 years 11 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
143
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
157
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
135
click to vote
MOC
2000
15 years 4 months ago
2000
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...