{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:42:25Z","timestamp":1725457345656},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540628989"},{"type":"electronic","value":"9783540690412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0031640","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T02:45:51Z","timestamp":1134269151000},"page":"688-697","source":"Crossref","is-referenced-by-count":1,"title":["The economic addition of functionality to a network"],"prefix":"10.1007","author":[{"given":"Sylvia","family":"Boyd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karina","family":"Marcus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"67_CR1","first-page":"261","volume":"5","author":"N.R. Achuthan","year":"1992","unstructured":"N.R. Achuthan and L. Caccetta. Minimum weight spanning trees with bounded diameter. Australasian Journal of Combinatorics, 5:261\u2013276, 1992.","journal-title":"Australasian Journal of Combinatorics"},{"key":"67_CR2","first-page":"51","volume":"10","author":"N.R. Achuthan","year":"1994","unstructured":"N.R. Achuthan, L. Caccetta, P. Caccetta, and J.F. Geelen. Computational methods for the diameter restricted minimum weight spanning tree problem. Australasian Journal of Combinatorics, 10:51\u201371, 1994.","journal-title":"Australasian Journal of Combinatorics"},{"key":"67_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02071976","volume":"33","author":"A. Balakrishnan","year":"1991","unstructured":"A. Balakrishnan, T.L. Magnanti, A. Shulman, and R.T. Wong. Models for planning capacity expansion in local access telecommunication networks. Annals of Operations Research, 33:239\u2013284, 1991.","journal-title":"Annals of Operations Research"},{"key":"67_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0167-5060(08)70728-3","volume":"1","author":"O. Bilde","year":"1977","unstructured":"O. Bilde and J. Krarup. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics, 1:79\u201397, 1977.","journal-title":"Annals of Discrete Mathematics"},{"key":"67_CR5","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/mnsc.35.6.645","volume":"35","author":"M.L. Brandeau","year":"1989","unstructured":"M.L. Brandeau and S.S. Chiu. An overview of representative problems in location research. Management Science, 35:645\u2013674, 1989.","journal-title":"Management Science"},{"key":"67_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BFb0121102","volume":"26","author":"P.M. Camerini","year":"1986","unstructured":"P.M. Camerini, A. Colorni, and F. Maffioli. Some experience in applying a stochastic method to location problems. Mathematical Programming Study, 26:229\u2013232, 1986.","journal-title":"Mathematical Programming Study"},{"key":"67_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0167-5060(08)70732-5","volume":"1","author":"G. Cornuejols","year":"1977","unstructured":"G. Cornuejols, M. Fisher, and G.L. Nemhauser. On the uncapacitated location problem. Annals of Discrete Mathematics, 1:163\u2013177, 1977.","journal-title":"Annals of Discrete Mathematics"},{"key":"67_CR8","unstructured":"G. Cornuejols, G.L. Nemhauser, and L.A. Wolsey. The uncapacited facility location problem. In R.L. Francis and P. Mirchandani, editors, Discrete Location Theory. Wiley Interscience, 1990."},{"key":"67_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1287\/opre.14.3.361","volume":"14","author":"M.A. Efroymson","year":"1966","unstructured":"M.A. Efroymson and T.L. Ray. A branch-bound algorithm for plant location. Operations Research, 14:361\u2013368, 1966.","journal-title":"Operations Research"},{"key":"67_CR10","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1287\/opre.26.6.992","volume":"26","author":"D. Erlenkotter","year":"1978","unstructured":"D. Erlenkotter. A dual-based procedure for uncapacitated facility location. Operations Research, 26:992\u20131009, 1978.","journal-title":"Operations Research"},{"key":"67_CR11","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability \u2014 A guide to the Theory of NP-completeness. Freeman, 1979."},{"key":"67_CR12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"O. Kariv and S.L. Hakimi. An algorithmic approach to network location problem. II: The p-medians. SIAM Journal on Applied Mathematics, 37:539\u2013560, 1979.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"67_CR13","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0377-2217(83)90181-9","volume":"12","author":"J. Krarup","year":"1983","unstructured":"J. Krarup and P.M. Pruzan. The simple plant location problem: Survey and synthesis. European Journal of Operations Research, 12:36\u201381, 1983.","journal-title":"European Journal of Operations Research"},{"key":"67_CR14","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal Jr.","year":"1956","unstructured":"J.B. Jr. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the AMS, 7:48\u201350, 1956.","journal-title":"Proceedings of the AMS"},{"key":"67_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/TCOM.1977.1093710","volume":"Com-25","author":"P.V. McGregor","year":"1977","unstructured":"P.V. McGregor and D. Shen. Network design: An algorithm for the facility location problem. IEEE Transactions on Communications, Com-25:61\u201373, 1977.","journal-title":"IEEE Transactions on Communications"},{"key":"67_CR16","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1287\/opre.25.4.709","volume":"25","author":"G.L. Narula","year":"1977","unstructured":"G.L. Narula, U.I. Ogbu, and H.M. Samuelson. An algorithm for the p-median problem. Operations Research, 25:709\u2013713, 1977.","journal-title":"Operations Research"},{"key":"67_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/322307.322309","volume":"29","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and M. Yannakakis. The complexity of restricted spanning tree problems. Journal of the ACM, 29:285\u2013309, 1982.","journal-title":"Journal of the ACM"},{"key":"67_CR18","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"R.C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389\u20131401, 1957.","journal-title":"Bell System Technical Journal"},{"key":"67_CR19","first-page":"1","volume":"6","author":"G.M. Schneider","year":"1982","unstructured":"G.M. Schneider and M.N. Zastrow. An algorithm for the design of multilevel concentrator networks. Computer Networks, 6:1\u201311, 1982.","journal-title":"Computer Networks"},{"key":"67_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/opre.17.1.85","volume":"17","author":"K. Spielberg","year":"1969","unstructured":"K. Spielberg. Algorithms for the simple plant-location problem with some side conditions. Operations Research, 17:85\u2013111, 1969.","journal-title":"Operations Research"},{"key":"67_CR21","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"B.C. Tansel","year":"1983","unstructured":"B.C. Tansel, R.L. Francis, and T.J Lowe. Location on Networks: a survey. Part I: the p-center and p-median problems. Management Science, 29:482\u2013511, 1983.","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T22:39:32Z","timestamp":1547851172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628989","9783540690412"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0031640","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}