5595 search results - page 409 / 1119 » Approximation Algorithms for Clustering Problems |
188
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
168
click to vote
WINE
2005
Springer
16 years 9 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
212
click to vote
ICTAI
2006
IEEE
16 years 26 days ago
2006
IEEE
The goal of spatial co-location pattern mining is to find subsets of spatial features frequently located together in spatial proximity. Example co-location patterns include servi...
147
click to vote
IPCCC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we propose a novel and efficient content-aware dispatching algorithm. Our approach eliminates the potential bottleneck and the single point of failure problems ...
224
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...