{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:43Z","timestamp":1725512143552},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729181"},{"type":"electronic","value":"9783540729518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72951-8_1","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T00:03:25Z","timestamp":1183334605000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Fast Distributed Algorithms Via Primal-Dual (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Panconesi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., et al.: A unified approach to approximating resource allocation and scheduling. Journal of the ACM\u00a048, 1069\u20131090 (2001)","journal-title":"Journal of the ACM"},{"key":"1_CR2","unstructured":"Chudak, F., et al.: Primal-Dual Distributed Algorithms for Covering and Facility Location Problems. Submitted."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Grandoni, F., et al.: Primal-Dual based Distributed Algorithms for Vertex Cover with Semi-Hard Capacities. In: Proceedings of Twenty-Fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2005) (2005)","DOI":"10.1145\/1073814.1073835"},{"key":"1_CR4","unstructured":"Guha, S., et al.: Capacitated vertex covering with applications. In: Proceedings, ACM-SIAM Symposium on Discrete Algorithms, pp. 858\u2013865 (2002)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Guha, S., et al.: Capacitated vertex covering. Journal of Algorithms, 257\u2013270 (2003)","DOI":"10.1016\/S0196-6774(03)00053-1"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.1994.1036","volume":"17","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U., Young, N.: A primal-dual parallel approximation technique applied to weighted set and vertex covers. J. Algorithms\u00a017(2), 280\u2013289 (1994)","journal-title":"J. Algorithms"},{"key":"1_CR7","unstructured":"Panconesi, A., Sozio, M.: Fast Distributed Scheduling via Primal-Dual. Submitted."},{"key":"1_CR8","unstructured":"Sozio, M.: Efficient Distributed Algorithms via the Primal-Dual Schema. PhD dissertation, Sapienza University, Rome, Italy (October 2006)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72951-8_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:08:46Z","timestamp":1605762526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72951-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729181","9783540729518"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72951-8_1","relation":{},"subject":[]}}