136 search results - page 2 / 28 » A Constant-Factor Approximation Algorithm for the k-Median P... |
STOC
2000
ACM
14 years 28 days ago
2000
ACM
WADS
2007
Springer
14 years 2 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...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
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...
APPROX
2006
Springer
14 years 10 days ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
ALGORITHMICA
2011
13 years 3 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...