5595 search results - page 299 / 1119 » Approximation Algorithms for Clustering Problems |
169
Voted
ICALP
2005
Springer
16 years 5 days ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
208
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
188
click to vote
ECCC
2000
15 years 6 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
162
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
203
click to vote
APPROX
2004
Springer
16 years 2 days ago
2004
Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...