628 search results - page 107 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
94
Voted
WINET
2008
15 years 2 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
127
Voted
NETWORKING
2007
15 years 4 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
115
Voted
SIAMDM
2008
15 years 2 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
111
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
120
click to vote
TIT
2008
15 years 2 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...