287 search results - page 1 / 58 » Constant Factor Approximations for the Hotlink Assignment Pr... |
140
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
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...
136
click to vote
JCSS
2002
15 years 1 months ago
2002
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...
200
Voted
SODA
2012
ACM
13 years 4 months ago
2012
ACM
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...
STOC
2000
ACM
15 years 6 months ago
2000
ACM
150
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...