Sciweavers

192 search results - page 1 / 39
» A Constant-Factor Approximation Algorithm for the Multicommo...
Sort
View
FOCS
2002
IEEE
13 years 8 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
AAIM
2006
Springer
110views Algorithms» more  AAIM 2006»
13 years 9 months ago
Non-metric Multicommodity and Multilevel Facility Location
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 1 months ago
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw...
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 3 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...