Sciweavers

344 search results - page 1 / 69
» A constant factor approximation algorithm for a class of cla...
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 6 months 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
JCSS
2002
199views more  JCSS 2002»
13 years 4 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...
CATS
2006
13 years 5 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
13 years 10 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs