36 search results - page 5 / 8 » Improved Approximation Algorithms for the Spanning Star Fore... |
135
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
135
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
146
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
149
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
172
click to vote
FSTTCS
2003
Springer
15 years 9 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...