3875 search results - page 375 / 775 » Approximation algorithms for the 0-extension problem |
205
click to vote
FLAIRS
2004
15 years 8 months ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
182
click to vote
WSC
2008
15 years 9 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
191
click to vote
TCS
2010
15 years 5 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
167
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
231
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...