
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
Costdistance: two metric network design
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
A. Meyerson, K. Munagala, S. Plotkin, "Costdistance: two metric network design," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 624, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892330, author = {A. Meyerson and K. Munagala and S. Plotkin}, title = {Costdistance: two metric network design}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {624}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892330}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Costdistance: two metric network design SN  02725428 SP EP A1  A. Meyerson, A1  K. Munagala, A1  S. Plotkin, PY  2000 KW  facility location; trees (mathematics); network synthesis; randomised algorithms; approximation theory; computational complexity; telecommunication network routing; costdistance problem; 2metric network design; Steiner tree; edge cost sum optimization; sourcesink distance sum optimization; randomized approximation scheme; source number; logarithmic approximation; singlesink buyatbulk problem; variable pipe types; cost; edges; singlesource multicast trees; delay properties; multilevel facility location VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
Presents the costdistance problem, which consists of finding a Steiner tree which optimizes the sum of edge costs along one metric and the sum of sourcesink distances along an unrelated second metric. We give the first known O(log k) randomized approximation scheme for the costdistance problem, where k is the number of sources. We reduce several common network design problems to costdistance problems, obtaining (in some cases) the first known logarithmic approximation for them. These problems include a singlesink buyatbulk problem with variable pipe types between different sets of nodes, facility location with buyatbulktype costs on edges, constructing singlesource multicast trees with good cost and delay properties, and multilevel facility location. Our algorithm is also easier to implement and significantly faster than previously known algorithms for buyatbulk design problems.
Index Terms:
facility location; trees (mathematics); network synthesis; randomised algorithms; approximation theory; computational complexity; telecommunication network routing; costdistance problem; 2metric network design; Steiner tree; edge cost sum optimization; sourcesink distance sum optimization; randomized approximation scheme; source number; logarithmic approximation; singlesink buyatbulk problem; variable pipe types; cost; edges; singlesource multicast trees; delay properties; multilevel facility location
Citation:
A. Meyerson, K. Munagala, S. Plotkin, "Costdistance: two metric network design," focs, pp.624, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.