217 search results - page 30 / 44 » Approximating Minimum Manhattan Networks |
IMC
2003
ACM
14 years 3 months ago
2003
ACM
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
DCOSS
2008
Springer
13 years 11 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
WCNC
2010
IEEE
14 years 1 months ago
2010
IEEE
—This paper considers the tradeoff between bursty and continuous transmissions in wireless ad hoc networks. In our network model, packets belonging to specific transmitters arri...
ALT
2010
Springer
13 years 11 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
IPPS
1998
IEEE
14 years 2 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...