632 search results - page 28 / 127 » On the Approximability of the Steiner Tree Problem |
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
CORR
2010
Springer
13 years 8 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
2010
13 years 10 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
COMGEO
2002
ACM
13 years 8 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
COR
2011
13 years 3 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...