{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:03Z","timestamp":1746115863079,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386992"},{"type":"electronic","value":"9783642387005"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38700-5_16","type":"book-chapter","created":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T04:59:57Z","timestamp":1369803597000},"page":"234-244","source":"Crossref","is-referenced-by-count":0,"title":["Conquering Large Zones by Exploiting Task Allocation and Graph-Theoretical Algorithms"],"prefix":"10.1007","author":[{"given":"Chengqian","family":"Li","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Annals of Mathematics and Artificial Intelligence","author":"T. Behrens","year":"2010","unstructured":"Behrens, T., Dastani, M., Dix, J., K\u00f6ster, M., Nov\u00e1k, P.: Special issue about Multi-Agent-Contest I. In: Annals of Mathematics and Artificial Intelligence, vol.\u00a059. Springer, Netherlands (2010)"},{"key":"16_CR2","volume-title":"Annals of Mathematics and Artificial Intelligence","author":"T. Behrens","year":"2011","unstructured":"Behrens, T., Dix, J., K\u00f6ster, M., H\u00fcbner, J.: Special issue about Multi-Agent-Contest II. In: Annals of Mathematics and Artificial Intelligence, vol.\u00a061. Springer, Netherlands (2011)"},{"key":"16_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Section 22.2: Breadth-first search. In: Introduction to Algorithms, pp. 531\u2013539. MIT Press and McGraw-Hill (2001)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. In: Numerische Mathematik, vol.\u00a01, pp. 260\u2013271. Springer (1959)","DOI":"10.1007\/BF01386390"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69 B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1 vertices. J. of Res. the Nat. Bureau of Standards\u00a069 B, 125\u2013130 (1965)","journal-title":"J. of Res. the Nat. Bureau of Standards"},{"key":"16_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. The MIT Press, Cambridge (1995)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W., Yaw, B.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart, 83\u201397 (1955)","DOI":"10.1002\/nav.3800020109"},{"issue":"2","key":"16_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"J.B. Orlin","year":"1993","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Operations Research\u00a041(2), 338\u2013350 (1993)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Programming Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38700-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T11:36:09Z","timestamp":1746012969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38700-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386992","9783642387005"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38700-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}