6 search results - page 1 / 2 » Facility location and the geometric minimum-diameter spannin... |
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
ENDM
2010
13 years 4 months ago
2010
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
CCCG
2003
13 years 6 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....
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
IPCO
2001
13 years 6 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...