{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:09:35Z","timestamp":1725559775784},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_69","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T14:58:59Z","timestamp":1279465139000},"page":"853-865","source":"Crossref","is-referenced-by-count":4,"title":["The Generalized Deadlock Resolution Problem"],"prefix":"10.1007","author":[{"given":"Kamal","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MohammadTaghi","family":"Hajiaghayi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Micali, S.: Dynamic deadlock resolution protocols. In: The 27th Annual Symposium on Foundations of Computer Science, pp. 196\u2013207 (1986)","DOI":"10.1109\/SFCS.1986.16"},{"key":"69_CR2","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1137\/S0097539796305109","volume":"27","author":"R. Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput.\u00a027, 942\u2013959 (1998)","journal-title":"SIAM J. Comput."},{"key":"69_CR3","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1145\/800222.806756","volume-title":"Proceedings of the 3rd annual ACM symposium on Principles of distributed computing","author":"G. Bracha","year":"1984","unstructured":"Bracha, G., Toueg, S.: A distributed algorithm for generalized deadlock detection. In: Proceedings of the 3rd annual ACM symposium on Principles of distributed computing, pp. 285\u2013301. ACM Press, New York (1984)"},{"key":"69_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K.M. Chandy","year":"1985","unstructured":"Chandy, K.M., Lamport, L.: Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computer Systems (TOCS)\u00a03, 63\u201375 (1985)","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/800220.806693","volume-title":"Proceedings of the 1st ACM SIGACT-SIGOPS symposium on Principles of distributed computing","author":"K.M. Chandy","year":"1982","unstructured":"Chandy, K.M., Misra, J.: A distributed algorithm for detecting resource deadlocks in distributed systems. In: Proceedings of the 1st ACM SIGACT-SIGOPS symposium on Principles of distributed computing, pp. 157\u2013164. ACM Press, New York (1982)"},{"key":"69_CR6","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/357360.357365","volume":"1","author":"K.M. Chandy","year":"1983","unstructured":"Chandy, K.M., Misra, J., Haas, L.M.: Distributed deadlock detection. ACM Transactions on Computer Systems (TOCS)\u00a01, 144\u2013156 (1983)","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"69_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Chekuri, C., Cheung, T.-y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. J. Algorithms\u00a033, 73\u201391 (1999)","journal-title":"J. Algorithms"},{"key":"69_CR8","doi-asserted-by":"crossref","unstructured":"Cheriyan, J., Karloff, H.J., Rabani, Y.: Approximating directed multicuts. In: The 42th Annual Symposium on Foundations of Computer Science, pp. 348\u2013356 (2001)","DOI":"10.1109\/SFCS.2001.959906"},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., Naor, J., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020, 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"69_CR10","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM\u00a045, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"69_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/131214.131229","volume-title":"Proceedings of the 1992 ACM annual conference on Communications","author":"M. Flatebo","year":"1992","unstructured":"Flatebo, M., Datta, A.K.: Self-stabilizing deadlock detection algorithms. In: Proceedings of the 1992 ACM annual conference on Communications, pp. 117\u2013122. ACM Press, New York (1992)"},{"key":"69_CR12","unstructured":"Gray, J., Homan, P., Obermarck, R., Korth, H.: A straw man analysis of probability of waiting and deadlock. In: Proceedings of the 5th Internafional Conference on Distributed Data Management and Computer Networks (1981)"},{"key":"69_CR13","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: The 35th Annual ACM Symposium on Theory of Computing (STOC 2003), pp. 585\u2013594 (2003)","DOI":"10.1145\/780542.780628"},{"key":"69_CR14","first-page":"125","volume-title":"Proceedings of the 6th PODC","author":"J.-M. Helary","year":"1987","unstructured":"Helary, J.-M., Jard, C., Plouzeau, N., Raynal, M.: Detection of stable properties in distributed applications. In: Proceedings of the 6th PODC, pp. 125\u2013136. ACM Press, New York (1987)"},{"key":"69_CR15","unstructured":"Herman, T., Chandy, K.M.: A distributed procedure to detect and\/or deadlock, Tech. Rep. TR LCS-8301, Dept. of Computer Sciences, Univ. of Texas (1983)"},{"key":"69_CR16","unstructured":"Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: The 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 266\u2013274 (2003)"},{"key":"69_CR17","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1145\/45075.46163","volume":"19","author":"E. Knapp","year":"1987","unstructured":"Knapp, E.: Deadlock detection in distributed databases. ACM Computing Surveys (CSUR)\u00a019, 303\u2013328 (1987)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"69_CR18","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM\u00a046, 787\u2013832 (1999)","journal-title":"J. ACM"},{"key":"69_CR19","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R.J. Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput.\u00a09, 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"69_CR20","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. Assoc. Comput. Mach.\u00a041, 960\u2013981 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"69_CR21","first-page":"411","volume-title":"Proceedings of the 4th international conference on Information and knowledge management","author":"K. Makki","year":"1995","unstructured":"Makki, K., Pissinou, N.: Detection and resolution of deadlocks in distributed database systems. In: Proceedings of the 4th international conference on Information and knowledge management, pp. 411\u2013416. ACM Press, New York (1995)"},{"key":"69_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P.D. Seymour","year":"1995","unstructured":"Seymour, P.D.: Packing directed circuits fractionally. Combinatorica\u00a015, 281\u2013288 (1995)","journal-title":"Combinatorica"},{"key":"69_CR23","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/32.979987","volume":"28","author":"H. Wu","year":"2002","unstructured":"Wu, H., Chin, W.-N., Jaffar, J.: An efficient distributed deadlock avoidance algorithm for the and model. IEEE Transactions on Software Engineering\u00a028, 18\u201329 (2002)","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:47:07Z","timestamp":1619491627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11523468_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}