{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:44Z","timestamp":1725490304496},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73814-5_31","type":"book-chapter","created":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T05:31:44Z","timestamp":1188624704000},"page":"317-324","source":"Crossref","is-referenced-by-count":0,"title":["Some New Structural Properties of Shortest 2-Connected Steiner Networks"],"prefix":"10.1007","author":[{"given":"Shuying","family":"Peng","sequence":"first","affiliation":[]},{"given":"Meili","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shenggui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"T. C. Edwin","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","first-page":"617","volume-title":"Network Models, Handbook in Operations Research and Management Sciences Series","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Models, Handbook in Operations Research and Management Sciences Series, pp. 617\u2013672. North-Holland, New York (1995)"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1002\/(SICI)1097-0037(199809)32:2<133::AID-NET6>3.0.CO;2-C","volume":"32","author":"D.F. Hsu","year":"1998","unstructured":"Hsu, D.F., Hu, X.-D.: On shortest two-connected Steiner networks with Euclidean distance. Networks\u00a032(2), 133\u2013140 (1998)","journal-title":"Networks"},{"key":"31_CR3","unstructured":"Luebke, E.L.: K-connected Steiner network problems, PhD Thesis, University of North Carolina, USA (2002)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0167-6377(99)00068-1","volume":"26","author":"E.L. Luebke","year":"2000","unstructured":"Luebke, E.L., Provan, J.S.: On the structure and complexity of the 2-connected Steiner network problem in the plane. Oper. Res. Lett.\u00a026, 111\u2013116 (2000)","journal-title":"Oper. Res. Lett."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C.L. Monma","year":"1990","unstructured":"Monma, C.L., Munson, B.S., Pulleyblank, W.R.: Minimum-weight two-connected spanning networks. Math.\u00a0Prog.\u00a046, 153\u2013171 (1990)","journal-title":"Math.\u00a0Prog."},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.orl.2004.07.010","volume":"33","author":"P. Winter","year":"2005","unstructured":"Winter, P., Zachariasen, M.: Two-connected Steiner networks: structural properties. Oper. Res. Lett.\u00a033, 395\u2013402 (2005)","journal-title":"Oper. Res. Lett."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73814-5_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:00:27Z","timestamp":1619517627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73814-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738138"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73814-5_31","relation":{},"subject":[]}}