{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:24Z","timestamp":1725543984612},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114755"},{"type":"electronic","value":"9783642114762"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_9","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T06:15:31Z","timestamp":1264400131000},"page":"100-112","source":"Crossref","is-referenced-by-count":1,"title":["Stability of Networks in Stretchable Graphs"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Michael","family":"Gatto","sequence":"additional","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"33-34","key":"9_CR1","doi-asserted-by":"publisher","first-page":"3190","DOI":"10.1016\/j.cma.2007.03.003","volume":"196","author":"H.-G. Beyer","year":"2007","unstructured":"Beyer, H.-G., Sendhoff, B.: Robust optimization - a comprehensive survey. Computer Methods in Applied Mechanics and Engineering\u00a0196(33-34), 3190\u20133218 (2007)","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"issue":"6","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/0221070","volume":"21","author":"B. Dixon","year":"1992","unstructured":"Dixon, B., Rauch, M., Tarjan, R.E.: Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput.\u00a021(6), 1184\u20131192 (1992)","journal-title":"SIAM J. Comput."},{"key":"9_CR3","series-title":"Int. Series in Operations Research and Management Science","volume-title":"Advances in sensitivity analysis and parametric programming","year":"1997","unstructured":"Gal, T., Greenberg, H.J. (eds.): Advances in sensitivity analysis and parametric programming. Int. Series in Operations Research and Management Science, vol.\u00a06. Kluwer Academic Publishers, Boston (1997)"},{"key":"9_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Dordrecht (1997)"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/505241.505243","volume":"49","author":"S. Pettie","year":"2002","unstructured":"Pettie, S., Ramachandran, V.: An optimal minimum spanning tree algorithm. J. ACM\u00a049(1), 16\u201334 (2002)","journal-title":"J. ACM"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1007\/11602613_96","volume-title":"Algorithms and Computation","author":"S. Pettie","year":"2005","unstructured":"Pettie, S.: Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 964\u2013973. Springer, Heidelberg (2005)"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230100402","volume":"10","author":"D.R. Shier","year":"1980","unstructured":"Shier, D.R., Witzgall, C.: Edge tolerances in shortest path and network flow problems. Networks\u00a010(4), 277\u2013291 (1980)","journal-title":"Networks"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R.E. Tarjan","year":"1982","unstructured":"Tarjan, R.E.: Sensitivity analysis of minimum spanning trees and shortest path trees. Inf. Proc. Letters\u00a014(1), 30\u201333 (1982)","journal-title":"Inf. Proc. Letters"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11476-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T07:48:35Z","timestamp":1552376915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11476-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}