5595 search results - page 319 / 1119 » Approximation Algorithms for Clustering Problems |
159
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
169
click to vote
ISSAC
2004
Springer
16 years 9 days ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
180
click to vote
ALGOSENSORS
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
238
click to vote
JCSS
2008
15 years 7 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
165
click to vote
SAT
2007
Springer
16 years 1 months 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...