@inproceedings{subramanian_centralized_1991,
	title = {Centralized multi-point routing in wide area networks},
	isbn = {0-8186-2136-2},
	doi = {10.1109/SOAC.1991.143844},
	booktitle = {Proceedings of the 1991 {Symposium} on {Applied} {Computing}},
	publisher = {IEEE},
	author = {Subramanian, N. and Liu, S.},
	year = {1991},
	keywords = {Application software, Bandwidth, Cities and towns, Communication networks, Greedy algorithms, Intelligent networks, NP complete, Routing, Steiner tree problem, TV, Tree graphs, Wide area networks, bandwidth utilization, cable television, centralized networks, computational complexity, computer networks, customer nodes, heuristics, link weights, minimum cost spanning tree, network nodes, point to multi-point routing, routing tree topology, static networks, telecommunication networks, trees (mathematics)},
	pages = {46--52}
}

{"_id":"Bi6DxPe4w8LFryXDk","bibbaseid":"subramanian-liu-centralizedmultipointroutinginwideareanetworks-1991","downloads":0,"creationDate":"2016-12-19T20:50:58.643Z","title":"Centralized multi-point routing in wide area networks","author_short":["Subramanian, N.","Liu, S."],"year":1991,"bibtype":"inproceedings","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Centralized multi-point routing in wide area networks","isbn":"0-8186-2136-2","doi":"10.1109/SOAC.1991.143844","booktitle":"Proceedings of the 1991 Symposium on Applied Computing","publisher":"IEEE","author":[{"propositions":[],"lastnames":["Subramanian"],"firstnames":["N."],"suffixes":[]},{"propositions":[],"lastnames":["Liu"],"firstnames":["S."],"suffixes":[]}],"year":"1991","keywords":"Application software, Bandwidth, Cities and towns, Communication networks, Greedy algorithms, Intelligent networks, NP complete, Routing, Steiner tree problem, TV, Tree graphs, Wide area networks, bandwidth utilization, cable television, centralized networks, computational complexity, computer networks, customer nodes, heuristics, link weights, minimum cost spanning tree, network nodes, point to multi-point routing, routing tree topology, static networks, telecommunication networks, trees (mathematics)","pages":"46--52","bibtex":"@inproceedings{subramanian_centralized_1991,\n\ttitle = {Centralized multi-point routing in wide area networks},\n\tisbn = {0-8186-2136-2},\n\tdoi = {10.1109/SOAC.1991.143844},\n\tbooktitle = {Proceedings of the 1991 {Symposium} on {Applied} {Computing}},\n\tpublisher = {IEEE},\n\tauthor = {Subramanian, N. and Liu, S.},\n\tyear = {1991},\n\tkeywords = {Application software, Bandwidth, Cities and towns, Communication networks, Greedy algorithms, Intelligent networks, NP complete, Routing, Steiner tree problem, TV, Tree graphs, Wide area networks, bandwidth utilization, cable television, centralized networks, computational complexity, computer networks, customer nodes, heuristics, link weights, minimum cost spanning tree, network nodes, point to multi-point routing, routing tree topology, static networks, telecommunication networks, trees (mathematics)},\n\tpages = {46--52}\n}\n\n","author_short":["Subramanian, N.","Liu, S."],"key":"subramanian_centralized_1991","id":"subramanian_centralized_1991","bibbaseid":"subramanian-liu-centralizedmultipointroutinginwideareanetworks-1991","role":"author","urls":{},"keyword":["Application software","Bandwidth","Cities and towns","Communication networks","Greedy algorithms","Intelligent networks","NP complete","Routing","Steiner tree problem","TV","Tree graphs","Wide area networks","bandwidth utilization","cable television","centralized networks","computational complexity","computer networks","customer nodes","heuristics","link weights","minimum cost spanning tree","network nodes","point to multi-point routing","routing tree topology","static networks","telecommunication networks","trees (mathematics)"],"downloads":0,"html":""},"search_terms":["centralized","multi","point","routing","wide","area","networks","subramanian","liu"],"keywords":["application software","bandwidth","cities and towns","communication networks","greedy algorithms","intelligent networks","np complete","routing","steiner tree problem","tv","tree graphs","wide area networks","bandwidth utilization","cable television","centralized networks","computational complexity","computer networks","customer nodes","heuristics","link weights","minimum cost spanning tree","network nodes","point to multi-point routing","routing tree topology","static networks","telecommunication networks","trees (mathematics)"],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}