7006 search results - page 1063 / 1402 » Approximation Algorithms |
159
click to vote
ECCC
2006
15 years 6 months ago
2006
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
189
Voted
SECON
2008
IEEE
16 years 1 months ago
2008
IEEE
—Delay Tolerant Networks are wireless networks where disconnections may occur frequently due to propagation phenomena, node mobility, and power outages. Propagation delays may al...
187
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
175
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
217
click to vote
IPSN
2007
Springer
16 years 26 days ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...