{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:52:36Z","timestamp":1725699156368},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327100"},{"type":"electronic","value":"9783642327117"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-32711-7_1","type":"book-chapter","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T12:17:23Z","timestamp":1344601043000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["The Price of Evolution in Incremental Network Design (The Case of Ring Networks)"],"prefix":"10.1007","author":[{"given":"Saeideh","family":"Bakhshi","sequence":"first","affiliation":[]},{"given":"Constantine","family":"Dovrolis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Applegate, D., Bixby, R., Chvtal, V., Cook, W.: The Traveling Salesman Problem: (A Computational Study). Princeton University Press (2006)","DOI":"10.1515\/9781400841103"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM\u00a045, 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1017\/S0305004100034095","volume":"55","author":"J. Beardwood","year":"1959","unstructured":"Beardwood, J., Halton, J., Hammersley, J.: The shortest path through many points. Mathematical Proceedings of the Cambridge Philosophical Society\u00a0(55), 299\u2013327 (1959)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0142-0615(97)00037-9","volume":"20","author":"P. Carvalho","year":"1998","unstructured":"Carvalho, P., Ferreira, L., Lobo, F., Barruncho, L.: Optimal distribution network expansion planning under uncertainty by evolutionary decision convergence. International Journal of Electrical Power & Energy Systems\u00a020(2), 125\u2013129 (1998)","journal-title":"International Journal of Electrical Power & Energy Systems"},{"key":"1_CR5","unstructured":"Chiang, M., Yang, M.: Towards Network X-ities From a Topological Point of View: Evolvability and Scalability. In: Proc., Allerton Conf. on Comm., Control, and Computing (2004)"},{"key":"1_CR6","unstructured":"Geary, N., Antonopoulos, A., Drakopoulos, E., O\u2019Reilly, J.: Analysis of Optimisation Issues In Multi-Period DWDM Network Planning. In: IEEE INFOCOM (2001)"},{"issue":"5","key":"1_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TR.1986.4335542","volume":"35","author":"S. Gopal","year":"1986","unstructured":"Gopal, S., Jain, K.: On Network Augmentation. IEEE Transactions on Reliability\u00a035(5), 541\u2013543 (1986)","journal-title":"IEEE Transactions on Reliability"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Hahsler, M., Hornik, K.: TSP Infrastructure for the Traveling Salesperson Problem. IEEE\/ACM Transactions on Networking\u00a023(2) (December 2007)","DOI":"10.18637\/jss.v023.i02"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/COMST.2004.5342236","volume":"6","author":"M. Herzog","year":"2004","unstructured":"Herzog, M., Maier, M., Reisslein, M.: Metropolitan area packet-switched WDM networks: A survey on ring systems. IEEE Communications Surveys & Tutorials\u00a06(2), 2\u201320 (2004)","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1023\/A:1019188715963","volume":"7","author":"H. Lee","year":"1997","unstructured":"Lee, H., Dooly, D.: Heuristic algorithms for the fiber optic network expansion problem. Telecommunication Systems\u00a07, 355\u2013378 (1997)","journal-title":"Telecommunication Systems"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Munagala, K., Plotkin, S.: Designing Networks Incrementally. In: IEEE FOCS (2001)","DOI":"10.1109\/SFCS.2001.959915"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1023\/A:1010030918159","volume":"1","author":"M. Pickavet","year":"1999","unstructured":"Pickavet, M., Demeester, P.: Long-term planning of WDM networks: A comparison between single-period and multi-period techniques. Photonic Network Communications\u00a01(4), 331\u2013346 (1999)","journal-title":"Photonic Network Communications"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Pioro, M., Medhi, D.: Routing, Flow and Capacity Design in Communication and Computer Networks. The Morgan Kaufmann Series in Networking (2004)","DOI":"10.1016\/B978-012557189-0\/50011-1"},{"issue":"5964","key":"1_CR14","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1126\/science.1177894","volume":"327","author":"A. Tero","year":"2010","unstructured":"Tero, A., Takagi, S., Saigusa, T., Ito, K., Bebber, D., Fricker, M., Yumiki, K., Kobayashi, R., Nakagaki, T.: Rules for Biologically Inspired Adaptive Network Design. Science\u00a0327(5964), 439\u2013442 (2010)","journal-title":"Science"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Vajanapoom, K., Tipper, D.: Risk based incremental survivable network design (2007)","DOI":"10.1109\/DRCN.2007.4762292"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/24.93761","volume":"40","author":"T. Wu","year":"1991","unstructured":"Wu, T., Cardwell, R., Broyden, M.: A multi-period design model for survivable network architecture selection for SONET interoffice networks. IEEE Trans. on Reliability\u00a040, 417\u2013427 (1991)","journal-title":"IEEE Trans. on Reliability"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1002\/net.3230030302","volume":"3","author":"B. Yaged","year":"1973","unstructured":"Yaged, B.: Minimum Cost Routing for Dynamic Network Models. Networks\u00a03, 193\u2013224 (1973)","journal-title":"Networks"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230040104","volume":"4","author":"N. Zadeh","year":"1974","unstructured":"Zadeh, N.: On Building Minimum Cost Communication Networks over time. Networks\u00a04, 19\u201334 (1974)","journal-title":"Networks"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Bio-Inspired Models of Networks, Information, and Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32711-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T12:48:57Z","timestamp":1594558137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32711-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642327100","9783642327117"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32711-7_1","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2012]]}}}