105 search results - page 11 / 21 » Improved approximation algorithms for minimum-weight vertex ... |
146
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
140
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
167
click to vote
SAC
2003
ACM
15 years 9 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
132
click to vote
FOCS
2000
IEEE
15 years 7 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
138
click to vote
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
Web pages, like people, are often known by others in a variety of contexts. When those contexts are sufficiently distinct, a page's importance may be better represented by mu...