{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:20:21Z","timestamp":1725571221904},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174605"},{"type":"electronic","value":"9783642174612"}],"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-17461-2_22","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T09:53:59Z","timestamp":1292406839000},"page":"268-280","source":"Crossref","is-referenced-by-count":2,"title":["A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree"],"prefix":"10.1007","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1287\/opre.41.1.18","volume":"41","author":"M.O. Ball","year":"1993","unstructured":"Ball, M.O., Lin, F.L.: A Reliability Model Applied to Emergency Service Vehicle Location. Oper. Res.\u00a041(1), 18\u201336 (1993)","journal-title":"Oper. Res."},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/net.3230210306","volume":"21","author":"M.O. Ball","year":"1991","unstructured":"Ball, M.O., Provan, J.S., Shier, D.R.: Reliability Covering Problems. Networks\u00a021(3), 345\u2013357 (1991)","journal-title":"Networks"},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Application","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Application. Macmillan, London (1976)"},{"key":"22_CR4","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0304-3975(97)00124-2","volume":"209","author":"C.J. Colbourn","year":"1998","unstructured":"Colbourn, C.J., Xue, G.: A Linear Time Algorithms for Computing the Most Reliable Source on a Series-Parallel Graph with Unreliable Edges. Theor. Comput. Sci.\u00a0209, 331\u2013345 (1998)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Ding, W.: Computing the Most Reliable Source on Stochastic Ring Networks. In: WRI World Congress on Software Engineering 2009, Xiamen, China, May 19-21, vol.\u00a01, pp. 345\u2013347 (2009)","key":"22_CR6","DOI":"10.1109\/WCSE.2009.31"},{"doi-asserted-by":"crossref","unstructured":"Ding, W., Xue, G.: A Linear Time Algorithm for Computing a Most Reliable Source on a Tree Network with Faulty Nodes. Theor. Comput. Sci. (2009), doi:10.1016\/j.tcs.2009.08.003","key":"22_CR7","DOI":"10.1016\/j.tcs.2009.08.003"},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230220303","volume":"22","author":"H.A. Eiselt","year":"1992","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Location of Facilities on a Network Subject to a Single-Edge Failure. Networks\u00a022(3), 231\u2013246 (1992)","journal-title":"Networks"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/347476.347478","volume":"47","author":"G. Even","year":"2000","unstructured":"Even, G., Naor, J.S., Rao, S., Schieber, B.: Divide-and-conquer approximation algorithms via spreading metrics. Journal of the ACM\u00a047(4), 585\u2013616 (2000)","journal-title":"Journal of the ACM"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. The Computer Journal\u00a05(1), 10\u201316 (1962)","journal-title":"The Computer Journal"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<219::AID-NET7>3.0.CO;2-L","volume":"27","author":"E. Melachrinoudis","year":"1996","unstructured":"Melachrinoudis, E., Helander, M.E.: A Single Facility Location Problem on a Tree with Unreliable Edges. Networks\u00a027(3), 219\u2013237 (1996)","journal-title":"Networks"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1287\/trsc.13.2.85","volume":"13","author":"P.B. Mirchandani","year":"1979","unstructured":"Mirchandani, P.B., Odoni, A.R.: Locations of Medians on Stochastic Networks. Transport. Sci.\u00a013, 85\u201397 (1979)","journal-title":"Transport. Sci."},{"key":"22_CR13","first-page":"363","volume":"28","author":"L.D. Nel","year":"1990","unstructured":"Nel, L.D., Colbourn, C.J.: Locating a Broadcast Facility in an Unreliable Network. INFOR.\u00a028, 363\u2013379 (1990)","journal-title":"INFOR."},{"key":"22_CR14","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198533863.001.0001","volume-title":"Network Reliability and Algebraic Structure","author":"D.R. Shier","year":"1991","unstructured":"Shier, D.R.: Network Reliability and Algebraic Structure. Oxford University Press, New York (1991)"},{"key":"22_CR15","volume-title":"Introduction to Graph Theorey","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theorey. Prentice Hall, Englewood Cliffs (2001)"},{"doi-asserted-by":"crossref","unstructured":"Wu, I.-C., Kung, H.T.: Communication Complexity for Parallel Divide-and-Conquer. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS 1991), San Juan, Puerto Rico, pp. 151\u2013162 (October 1991)","key":"22_CR16","DOI":"10.1109\/SFCS.1991.185364"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/(SICI)1097-0037(199708)30:1<37::AID-NET5>3.0.CO;2-M","volume":"30","author":"G. Xue","year":"1997","unstructured":"Xue, G.: Linear Time Algorithms for Computing the Most Reliable Source on an Unreliable Tree Network. Networks\u00a030(1), 37\u201345 (1997)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17461-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T01:09:22Z","timestamp":1712020162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17461-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174605","9783642174612"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17461-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}