{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:03Z","timestamp":1725701643003},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_62","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"719-730","source":"Crossref","is-referenced-by-count":0,"title":["Routing Regardless of Network Stability"],"prefix":"10.1007","author":[{"given":"Bundit","family":"Laekhanukit","sequence":"first","affiliation":[]},{"given":"Adrian","family":"Vetta","sequence":"additional","affiliation":[]},{"given":"Gordon","family":"Wilfong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"62_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/90.993304","volume":"10","author":"T. Griffin","year":"2002","unstructured":"Griffin, T., Bruce Shepherd, F., Wilfong, G.T.: The stable paths problem and interdomain routing. IEEE\/ACM Trans. Netw.\u00a010(2), 232\u2013243 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"62_CR2","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"62_CR3","volume-title":"BGP4: Inter-Domain Routing in the Internet","author":"J.W. Stewart III","year":"1998","unstructured":"Stewart III, J.W.: BGP4: Inter-Domain Routing in the Internet. Addison-Wesley Longman Publishing Co., Inc., Boston (1998)"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Vissicchio, S., Cittadini, L., Vanbever, L., Bonaventure, O.: ibgp deceptions: More sessions, fewer routes. In: INFOCOM (2012)","DOI":"10.1109\/INFCOM.2012.6195595"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:05Z","timestamp":1620129305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}