{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:25:55Z","timestamp":1725539155448},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642054334"},{"type":"electronic","value":"9783642054341"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05434-1_25","type":"book-chapter","created":{"date-parts":[[2009,10,14]],"date-time":"2009-10-14T10:08:35Z","timestamp":1255514915000},"page":"252-262","source":"Crossref","is-referenced-by-count":2,"title":["Complexity and Approximation of a Geometric Local Robot Assignment Problem"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Bonorden","sequence":"first","affiliation":[]},{"given":"Bastian","family":"Degener","sequence":"additional","affiliation":[]},{"given":"Barbara","family":"Kempkes","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Pietrzyk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Bonorden, O., Degener, B., Kempkes, B., Pietrzyk, P.: Complexity and approximation of a geometric local robot assignment problem. Technical Report tr-ri-09-299, University of Paderborn (2009), http:\/\/wwwhni.uni-paderborn.de\/en\/alg\/publications\/","DOI":"10.1007\/978-3-642-05434-1_25"},{"issue":"9","key":"25_CR2","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"B.P. Gerkey","year":"2004","unstructured":"Gerkey, B.P., Mataric, M.J.: A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems. The International Journal of Robotics Research\u00a023(9), 939\u2013954 (2004)","journal-title":"The International Journal of Robotics Research"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Lin, L., Zheng, Z.: Combinatorial bids based multi-robot task allocation method. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation (IRCA), pp. 1145\u20131150 (2005)","DOI":"10.1109\/ROBOT.2005.1570270"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1109\/TRO.2004.839232","volume":"21","author":"W. Burgard","year":"2005","unstructured":"Burgard, W., Moors, M., Stachniss, C., Schneider, F.: Coordinated multi-robot exploration. IEEE Transactions on Robotics\u00a021(3), 376\u2013386 (2005)","journal-title":"IEEE Transactions on Robotics"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Ostergaard, E., Mataric, M., Sukhatme, G.: Distributed multi-robot task allocation for emergency handling. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems, vol.\u00a02, pp. 821\u2013826 (2001)","DOI":"10.1109\/IROS.2001.976270"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Tang, F., Parker, L.: A complete methodology for generating multi-robot task solutions using ASyMTRe-D and market-based task allocation. In: IEEE International Conference on Robotics and Automation, pp. 3351\u20133358 (2007)","DOI":"10.1109\/ROBOT.2007.363990"},{"key":"25_CR7","first-page":"27","volume-title":"Multi-Robot Systems. From Swarms to Intelligent Automata","author":"M.G. Lagoudakis","year":"2005","unstructured":"Lagoudakis, M.G., Berhault, M., Koenig, S., Keskinocak, P., Kleywegt, A.J.: Simple auctions with performance guarantees for multi-robot task allocation. In: Multi-Robot Systems. From Swarms to Intelligent Automata, vol.\u00a0III, pp. 27\u201338. Springer, Netherlands (2005)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth-bounded graphs. In: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing, PODC (2008)","DOI":"10.1145\/1400751.1400758"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/28395.28429","volume-title":"STOC 1987: Proceedings of the nineteenth annual ACM symposium on Theory of computing","author":"A. Goldberg","year":"1987","unstructured":"Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. In: STOC 1987: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pp. 315\u2013324. ACM, New York (1987)"},{"issue":"2-3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0166-218X(02)00205-6","volume":"126","author":"S. Sakai","year":"2003","unstructured":"Sakai, S., Togasaki, M., Yamazaki, K.: A note on greedy algorithms for the maximum weighted independent set problem. Discrete Applied Mathematics\u00a0126(2-3), 313\u2013322 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1073814.1073826","volume-title":"PODC 2005: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: PODC 2005: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pp. 60\u201368. ACM, New York (2005)"},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"25_CR13","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"4","key":"25_CR14","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: Complexity of network synchronization. J. ACM\u00a032(4), 804\u2013823 (1985)","journal-title":"J. ACM"},{"key":"25_CR15","first-page":"258","volume-title":"SFCS 1991: Proceedings of the 32nd annual symposium on Foundations of computer science","author":"B. Awerbuch","year":"1991","unstructured":"Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols (extended abstract). In: SFCS 1991: Proceedings of the 32nd annual symposium on Foundations of computer science, pp. 258\u2013267. IEEE Computer Society, Los Alamitos (1991)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05434-1_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:41Z","timestamp":1606186301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05434-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642054334","9783642054341"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05434-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}