534 search results - page 61 / 107 » Tight approximation algorithm for connectivity augmentation ... |
127
click to vote
ISAAC
2004
Springer
15 years 7 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
126
click to vote
SNPD
2007
15 years 3 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
123
click to vote
TON
2010
15 years 21 days ago
2010
—We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarante...
140
click to vote
COCOA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
127
click to vote
ALGORITHMICA
2010
15 years 2 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...