4781 search results - page 821 / 957 » Online algorithms for network design |
141
click to vote
TCAD
2008
15 years 1 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
126
click to vote
SODA
1998
ACM
15 years 2 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...
100
click to vote
CN
2006
15 years 1 months ago
2006
This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is ...
125
click to vote
MOBISYS
2011
ACM
14 years 4 months ago
2011
ACM
The explosive growth of the mobile application market has made it a significant challenge for the users to find interesting applications in crowded App Stores. To alleviate this...
WWW
2007
ACM
16 years 2 months ago
2007
ACM
This paper presents a structured P2P overlay SCAN that augments CAN overlay with long links based on Kleinberg's small-world model in a d-dimensional Cartesian space. The con...