5595 search results - page 725 / 1119 » Approximation Algorithms for Clustering Problems |
173
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
184
click to vote
CPAIOR
2006
Springer
15 years 10 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
196
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
215
click to vote
ICTAI
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
215
click to vote
INFORMATICALT
2011
15 years 1 months ago
2011
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...