356 search results - page 3 / 72 » Submodular Approximation: Sampling-based Algorithms and Lowe... |
118
Voted
NAACL
2010
15 years 15 days ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
127
Voted
SODA
2010
ACM
16 years 3 hour ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
137
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
141
Voted
NETWORKS
2006
15 years 2 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
WG
2001
Springer
15 years 7 months ago
2001
Springer