209 search results - page 21 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
184
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
157
click to vote
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
158
click to vote
ICPP
2005
IEEE
15 years 11 months ago
2005
IEEE
In wireless ad hoc networks, clustering is one of the most important approaches for many applications. A connected k-hop clustering network is formed by electing clusterheads in k...
179
click to vote
CCCG
2003
15 years 7 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
191
click to vote
FOCS
2008
IEEE
16 years 10 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...