757 search results - page 38 / 152 » On the hardness of approximating Max-Satisfy |
154
click to vote
MST
2010
14 years 8 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
122
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
165
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
105
click to vote
COCOON
2010
Springer
15 years 6 months ago
2010
Springer
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
227
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...