Sciweavers

2566 search results - page 5 / 514
» The Online Median Problem
Sort
View
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
15 years 1 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
84
Voted
CIKM
2009
Springer
15 years 4 months ago
Text summarization model based on the budgeted median problem
We propose a multi-document generic summarization model based on the budgeted median problem. Our model selects sentences to generate a summary so that every sentence in the docum...
Hiroya Takamura, Manabu Okumura
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 3 days ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
14 years 9 months ago
The Hamiltonian p-Median Problem
We deal, from a theoretical point of view, with the asymmetric Hamiltonian p
Holger Glaab, Alexander Pott
JCSS
2002
199views more  JCSS 2002»
14 years 9 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...