723 search results - page 137 / 145 » On the hyperbolicity constant in graphs |
180
click to vote
SPAA
2009
ACM
16 years 25 days ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
143
click to vote
INFOCOM
2009
IEEE
16 years 20 days ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
205
click to vote
ALGOSENSORS
2009
Springer
16 years 19 days ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
154
click to vote
ESA
2009
Springer
16 years 18 days ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
191
click to vote
FOCS
2008
IEEE
16 years 14 days ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...