217 search results - page 4 / 44 » Approximating Minimum Manhattan Networks |
COSIT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The paths of 2425 individual motorcycle trips made in London were analyzed in order to uncover the route choice decisions made by drivers. The paths were derived from glo...
ESA
2007
Springer
14 years 4 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
ADHOCNOW
2008
Springer
14 years 4 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
P2P
2009
IEEE
14 years 4 months ago
2009
IEEE
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...
SODA
1998
ACM
13 years 11 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...