
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
Building Steiner trees with incomplete global knowledge
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
D.R. Karget, M. Minkoff, "Building Steiner trees with incomplete global knowledge," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 613, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892329, author = {D.R. Karget and M. Minkoff}, title = {Building Steiner trees with incomplete global knowledge}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {613}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892329}, 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  Building Steiner trees with incomplete global knowledge SN  02725428 SP EP A1  D.R. Karget, A1  M. Minkoff, PY  2000 KW  trees (mathematics); facility location; uncertainty handling; clientserver systems; network synthesis; approximation theory; minimisation; combinational switching; Steiner trees; incomplete global knowledge; network usage minimization; data item distribution; datarequesting clients; vertex; connection probability; fixed data path specification; network design problems; concave cost functions; economies of scale; facility location problem; open facilities; minimum demand; bicriterion approximation; assignment cost VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
A networking problem of presentday interest is that of distributing a single data item to multiple clients while minimizing network usage. Steiner tree algorithms are a natural solution method, but only when the set of clients requesting the data is known. We study what can be done without this global knowledge, when a given vertex knows only the probability that any other client wishes to be connected, and must simply specify a fixed path to the data to be used in case it is requested. Our problem is an example of a class of network design problems with concave cost functions (which arise when the design problem exhibits economies of scale). In order to solve our problem, we introduce a new version of the facility location problem: one in which every open facility is required to have some minimum amount of demand assigned to it. We present a simple bicriterion approximation for this problem, one which is loose in both assignment cost and minimum demand, but within a constant factor of the optimum for both. This suffices for our application. We leave open the question of finding an algorithm that produces a truly feasible approximate solution.
Index Terms:
trees (mathematics); facility location; uncertainty handling; clientserver systems; network synthesis; approximation theory; minimisation; combinational switching; Steiner trees; incomplete global knowledge; network usage minimization; data item distribution; datarequesting clients; vertex; connection probability; fixed data path specification; network design problems; concave cost functions; economies of scale; facility location problem; open facilities; minimum demand; bicriterion approximation; assignment cost
Citation:
D.R. Karget, M. Minkoff, "Building Steiner trees with incomplete global knowledge," focs, pp.613, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.