7 search results - page 1 / 2 » The Minimum Manhattan Network Problem: A Fast Factor-3 Appro... |
JCDCG
2004
Springer
13 years 10 months ago
2004
Springer
COLOGNETWENTE
2008
13 years 6 months ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
COMGEO
2006
ACM
13 years 4 months ago
2006
ACM
WEA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...