Sciweavers

28 search results - page 6 / 6
» Random graphs in the monadic theory of order
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 10 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
13 years 10 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 5 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...