Sciweavers

710 search results - page 17 / 142
» On Minimum Power Connectivity Problems
Sort
View
93
Voted
ESA
2003
Springer
98views Algorithms» more  ESA 2003»
15 years 5 months ago
Network Lifetime and Power Assignment in ad hoc Wireless Networks
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
Gruia Calinescu, Sanjiv Kapoor, Alexander Olshevsk...
136
Voted
ALGOSENSORS
2009
Springer
15 years 7 months ago
A Note on Uniform Power Connectivity in the SINR Model
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne ...
121
Voted
ICALP
2007
Springer
15 years 6 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
80
Voted
DCC
2006
IEEE
16 years 14 hour ago
Time-Sharing Vs. Source-Splitting in the Slepian-Wolf Problem: Error Exponents Analysis
We discuss two approaches for decoding at arbitrary rates in the Slepian-Wolf problem - time sharing and source splitting - both of which rely on constituent vertex decoders. We c...
Michelle Effros, Muriel Médard, Todd P. Col...
114
Voted
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
15 years 6 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson