7006 search results - page 421 / 1402 » Approximation Algorithms |
114
click to vote
COLING
2008
15 years 6 months ago
2008
The task of identifying redundant information in documents that are generated from multiple sources provides a significant challenge for summarization and QA systems. Traditional ...
112
click to vote
TPDS
2008
15 years 4 months ago
2008
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
156
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
131
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
113
Voted
STOC
2002
ACM
16 years 5 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...