Author:
Liang Zhe,Chaovalitwongse Wanpracha Art
Publisher
Springer Science and Business Media LLC
Reference18 articles.
1. Aneja Y.P.: An integer linear programming approach to the Steiner problem in graphs. Networks 10(2), 167–178 (1980)
2. Balakrishnan A., Magnanti T.L., Wong R.T.: A dual-ascent procedure for large-scale uncapacitated network design. Oper. Res. 37(5), 716–740 (1989)
3. Cha M., Chaovalitwongse W.A., Moon S., Shaikh A., Yates J.: Efficient and scalable provisioning solutions for always-on multicast streaming services. Comput. Netw. 53(16), 2825–2839 (2009)
4. Garey M.R., Johnson D.S.: Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)
5. Goemans M.X., Myung Y.A.: Catalog of Steiner tree formulations. Networks 1, 19–28 (1993)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献