{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:06:24Z","timestamp":1777539984571,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341413","type":"print"},{"value":"9783540341420","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11752578_121","type":"book-chapter","created":{"date-parts":[[2006,6,9]],"date-time":"2006-06-09T03:44:36Z","timestamp":1149824676000},"page":"1002-1009","source":"Crossref","is-referenced-by-count":9,"title":["Parallel Processing Subsystems with Redundancy in\u00a0a\u00a0Distributed Environment"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Kosowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"121_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0167-6377(01)00068-2","volume":"28","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Timkovsky, V.G.: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters\u00a028, 205\u2013212 (2001)","journal-title":"Operations Research Letters"},{"key":"121_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0196-6774(90)90001-U","volume":"11","author":"F. Berman","year":"1990","unstructured":"Berman, F., Johnson, D., Leighton, T., Shor, P.W., Snyder, L.: Generalized planar matching. J.\u00a0of\u00a0Alg.\u00a011, 153\u2013184 (1990)","journal-title":"J.\u00a0of\u00a0Alg."},{"key":"121_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"K.M.J. Bontridder De","year":"2003","unstructured":"De Bontridder, K.M.J., Hald\u00f3rsson, B.V., Hald\u00f3rsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Mathematical Programming\u00a098, 477\u2013491 (2003)","journal-title":"Mathematical Programming"},{"key":"121_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"M.E. Dyer","year":"1986","unstructured":"Dyer, M.E., Frieze, A.M.: Planar 3DM is NP-complete. J.\u00a0of\u00a0Alg.\u00a07, 174\u2013184 (1986)","journal-title":"J.\u00a0of\u00a0Alg."},{"key":"121_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/88.242445","volume":"1","author":"Y. I-Ling","year":"1993","unstructured":"I-Ling, Y., Leiss, E.L., Bastani, F.B.: Exploiting redundancy to speed up parallel systems. IEEE Parallel & Distributed Technology: Sys. & Appl.\u00a01, 51\u201360 (1993)","journal-title":"IEEE Parallel & Distributed Technology: Sys. & Appl."},{"key":"121_CR6","volume-title":"Architecting Dependable Systems","author":"M. Jackson","year":"2005","unstructured":"Jackson, M.: Problem Structure and Dependable Architecture. In: Architecting Dependable Systems, vol.\u00a0III, Springer, Heidelberg (2005)"},{"key":"121_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/1097-0118(200104)36:4<175::AID-JGT1005>3.0.CO;2-T","volume":"36","author":"A. Kaneko","year":"2001","unstructured":"Kaneko, A., Kelmans, A., Nishimura, T.: On packing 3-vertex paths in a graph. J.\u00a0of\u00a0Graph Theory\u00a036, 175\u2013297 (2001)","journal-title":"J.\u00a0of\u00a0Graph Theory"},{"key":"121_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/jgt.10136","volume":"45","author":"A. Kelmans","year":"2004","unstructured":"Kelmans, A., Mubayi, D.: How many disjoint 2-edge paths must a cubic graph have? J.\u00a0of\u00a0Graph Theory\u00a045, 57\u201379 (2004)","journal-title":"J.\u00a0of\u00a0Graph Theory"},{"key":"121_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11424758_68","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"M. Ma\u0142afiejski","year":"2005","unstructured":"Ma\u0142afiejski, M., \u017byli\u0144ski, P.: Weakly cooperative guards in grids. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Lagan\u00e1, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03480, pp. 647\u2013656. Springer, Heidelberg (2005)"},{"key":"121_CR10","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1007\/BF01759074","volume":"6","author":"S. Masuyama","year":"1991","unstructured":"Masuyama, S., Ibaraki, T.: Chain packing in graphs. Algorithmica\u00a06, 826\u2013839 (1991)","journal-title":"Algorithmica"},{"key":"121_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E. Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximations: gap locations. Computational Complexity\u00a04, 133\u2013157 (1994)","journal-title":"Computational Complexity"},{"key":"121_CR12","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1147\/sj.63.0142","volume":"6","author":"G.S. Shedler","year":"1967","unstructured":"Shedler, G.S., Lehman, M.M.: Evaluation of redundancy in a parallel algorithm. IBM Systems Journal\u00a06, 142\u2013149 (1967)","journal-title":"IBM Systems Journal"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11752578_121.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:26Z","timestamp":1619506946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11752578_121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341413","9783540341420"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11752578_121","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}