{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T12:15:49Z","timestamp":1724501749129},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10479-015-2068-1","type":"journal-article","created":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:28:13Z","timestamp":1448929693000},"page":"315-328","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An estimate of the objective function optimum for the network Steiner problem"],"prefix":"10.1007","volume":"238","author":[{"given":"V.","family":"Kirzhner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Volkovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Ravve","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.-W.","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,1]]},"reference":[{"key":"2068_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10711-004-1528-6","volume":"109","author":"M Brazil","year":"2004","unstructured":"Brazil, M., Thomas, D. A., & Weng, J. F. (2004). Upper and lower bounds for the lengths of Steiner trees in 3-space. Geometriae Dedicata, 109, 107\u2013119.","journal-title":"Geometriae Dedicata"},{"key":"2068_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(02)00762-8","volume":"260","author":"Dietmar Cieslik","year":"2003","unstructured":"Cieslik, Dietmar. (2003). The Steiner ratio of several discrete metric spaces. Discrete Mathematics, 260, 189\u2013196.","journal-title":"Discrete Mathematics"},{"key":"2068_CR3","first-page":"227","volume-title":"Encyclopedia of optimization","author":"D-Z Du","year":"2001","unstructured":"Du, D.-Z., Lu, B., Ngo, H., & Pardalos, P. M. (2001). Steiner tree problems. In C. Floudas & P. Pardalos (Eds.), Encyclopedia of optimization (Vol. 5, pp. 227\u2013290). Dordrecht: Kluwer Academic Publishers."},{"key":"2068_CR4","doi-asserted-by":"crossref","unstructured":"Garey, M. R., Graham, R. L., & Johnson, D. S. (1976). Some NP-complete geometric problems. In Eighth annual symposium on theory of computing, pp 10-22.","DOI":"10.1145\/800113.803626"},{"key":"2068_CR5","first-page":"11","volume":"16","author":"EN Gilbert","year":"1968","unstructured":"Gilbert, E. N., & Pollak, H. O. (1968). Steiner minimal trees. SIAM Journal on Applied Mathematics, 16, 11\u201329.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2068_CR6","volume-title":"Inequalities","author":"GH Hardy","year":"1952","unstructured":"Hardy, G. H., Littlewood, J. E., & Polya, G. (1952). Inequalities (2nd ed.). Cambridge: Cambridge University Press.","edition":"2"},{"key":"2068_CR7","volume-title":"The Steiner tree problem","author":"FK Hwang","year":"1992","unstructured":"Hwang, F. K., Richards, D. S., & Winter, P. (1992). The Steiner tree problem. North-Holland: Elsevier."},{"key":"2068_CR8","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1007\/s00453-008-9254-3","volume":"57","author":"N Innami","year":"2010","unstructured":"Innami, N., Kim, B. H., Mashiko, Y., & Shiohama, K. (2010). The Steiner ratio conjecture of Gilbert-Pollak may still be open. Algorithmica, 57, 869\u2013872.","journal-title":"Algorithmica"},{"key":"2068_CR9","unstructured":"Kirzhner, V., & Rublinecky, V. I. (1974). An upper limit for the traveling salesman minimal tour. In Proceeding low temperature physic institute \u201ccomputing mathematics & Computers\u201d, V 1974, pp 120\u2013122 (in Russian)."},{"key":"2068_CR10","volume-title":"Implementing discrete mathematics: Combinatorics and graph theory with mathematica","author":"S Skiena","year":"1990","unstructured":"Skiena, S. (1990). Implementing discrete mathematics: Combinatorics and graph theory with mathematica. Reading, MA: Addison-Wesley. p. 235."},{"key":"2068_CR11","unstructured":"Zaycev, I., Vayner, V., & Kirzhner, V. (1988). An estimate of the functional optimum in problems of connecting objects with a network. In Ukrainian Doklady, Series A (Vol. 8, pp. 71\u201374). (in Russian)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2068-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2068-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2068-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:17Z","timestamp":1559138957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2068-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,1]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["2068"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2068-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,1]]}}}