7930 search results - page 339 / 1586 » Greedy in Approximation Algorithms |
170
click to vote
SSS
2009
Springer
16 years 1 months ago
2009
Springer
We consider setting up sleep scheduling in sensor networks. We formulate the problem as an instance of the fractional domatic partition problem and obtain a distributed approximati...
164
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
189
click to vote
APPROX
2008
Springer
15 years 8 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...
179
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We propose a deterministic method to evaluate the integral of a positive function based on soft-binning functions that smoothly cut the integral into smaller integrals that are ea...
160
click to vote
SAT
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...