3875 search results - page 121 / 775 » Approximation algorithms for the 0-extension problem |
150
Voted
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
149
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
141
click to vote
SIAMNUM
2010
14 years 11 months ago
2010
Abstract. We introduce hybridization and postprocessing techniques for the RaviartThomas approximation of second-order elliptic eigenvalue problems. Hybridization reduces the Ravia...
176
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
137
click to vote
IPL
2008
15 years 4 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...