{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:39Z","timestamp":1792111479732,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":6,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_232","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:06Z","timestamp":1461268986000},"page":"1298-1302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Congestion Redundant Assignments"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"232_CR13446","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s00453-001-0080-0","volume":"32","author":"D Fotakis","year":"2002","unstructured":"Fotakis D, Spirakis P (2002) Minimum congestion redundant assignments to tolerate random faults. Algorithmica 32:396\u2013422","journal-title":"Algorithmica"},{"key":"232_CR13447","first-page":"372","volume-title":"Proceedings of the 21st international symposium on mathematical foundations of computer science. Lecture notes in computer science","author":"L Gasieniec","year":"1996","unstructured":"Gasieniec L, Kranakis E, Krizanc D, Pelc A (1996) Minimizing congestion of layouts for ATM networks with faulty links. In: Penczek W, Szalas A (eds) Proceedings of the 21st international symposium on mathematical foundations of computer science. Lecture notes in computer science, vol 1113. Springer, Berlin, pp 372\u2013381"},{"key":"232_CR13448","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1137\/S0097539796298340","volume":"29","author":"D Karger","year":"1999","unstructured":"Karger D (1999) A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM J Comput 29:492\u2013514","journal-title":"SIAM J Comput"},{"key":"232_CR13449","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/S0097539797329142","volume":"30","author":"J Kleinberg","year":"2000","unstructured":"Kleinberg J, Rabani Y, Tardos E (2000) Allocating bandwidth for bursty connections. SIAM J Comput 30:191\u2013217","journal-title":"SIAM J Comput"},{"key":"232_CR13450","first-page":"73","volume":"10","author":"M Lomonosov","year":"1974","unstructured":"Lomonosov M (1974) Bernoulli scheme with closure. Probl Inf Transm 10:73\u201381","journal-title":"Probl Inf Transm"},{"key":"232_CR13451","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(92)90369-Q","volume":"100","author":"S Toda","year":"1992","unstructured":"Toda S, Watanabe O (1992) Polynomial-time 1-turing reductions from #PH to #P. Theor Comput Sci 100:205\u2013221","journal-title":"Theor Comput Sci"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:55:37Z","timestamp":1792108537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_232","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}