909 search results - page 28 / 182 » On the approximability of some network design problems |
106
click to vote
WCNC
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract—In this paper, we consider a robust design of MIMOrelay precoder and receive filter for the destination nodes in a non-regenerative multiple-input multiple-output (MIMO...
125
click to vote
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
116
click to vote
ESA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
100
click to vote
ADHOC
2010
15 years 1 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
106
click to vote
CCR
2006
15 years 1 months ago
2006
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...