{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:10Z","timestamp":1750308790803,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T00:00:00Z","timestamp":1249948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,8,11]]},"DOI":"10.1145\/1583991.1584058","type":"proceedings-article","created":{"date-parts":[[2009,8,17]],"date-time":"2009-08-17T18:34:59Z","timestamp":1250534099000},"page":"260-269","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["An optimal local approximation algorithm for max-min linear programs"],"prefix":"10.1145","author":[{"given":"Patrik","family":"Flor\u00e9en","sequence":"first","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]},{"given":"Joel","family":"Kaasinen","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]},{"given":"Jukka","family":"Suomela","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]}],"member":"320","published-online":{"date-parts":[[2009,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804655"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"M. Åstrand P. Floréen V. Polishchuk J. Rybicki J. Suomela and J. Uitto. A local 2-approximation algorithm for the vertex cover problem 2009. Manuscript submitted for publication.  M. Åstrand P. Floréen V. Polishchuk J. Rybicki J. Suomela and J. Uitto. A local 2-approximation algorithm for the vertex cover problem 2009. Manuscript submitted for publication.","DOI":"10.1007\/978-3-642-04355-0_21"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48247"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_6"},{"key":"e_1_3_2_1_6_1","unstructured":"P. Floréen M. Hassinen P. Kaski and J. Suomela. Local approximation algorithms for a class of 0\/1 max-min linear programs 2008. Manuscript arXiv:0806.0282 {cs.DC}.  P. Floréen M. Hassinen P. Kaski and J. Suomela. Local approximation algorithms for a class of 0\/1 max-min linear programs 2008. Manuscript arXiv:0806.0282 {cs.DC}."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92862-1_2"},{"volume-title":"Proc. 22nd International Parallel and Distributed Processing Symposium (IPDPS 2008","year":"2008","author":"Flor P.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214106"},{"key":"e_1_3_2_1_10_1","unstructured":"F. Kuhn. The Price of Locality: Exploring the Complexity of Distributed Coordination Primitives. PhD thesis ETH Zürich 2005.  F. Kuhn. The Price of Locality: Exploring the Complexity of Distributed Coordination Primitives. PhD thesis ETH Zürich 2005."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109666"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_27"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/527073.881429"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793254571"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167127"},{"volume-title":"Department of Computer Science","year":"2009","author":"Suomela J.","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","unstructured":"J. Suomela. Survey of local algorithms http:\/\/www.iki.fi\/jukka.suomela\/local-survey 2009. Manuscript submitted for publication.  J. Suomela. Survey of local algorithms http:\/\/www.iki.fi\/jukka.suomela\/local-survey 2009. Manuscript submitted for publication."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.481599"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875556"}],"event":{"name":"SPAA 09: 21st ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Calgary AB Canada","acronym":"SPAA 09"},"container-title":["Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584058","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1583991.1584058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:55Z","timestamp":1750278175000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1583991.1584058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,11]]},"references-count":20,"alternative-id":["10.1145\/1583991.1584058","10.1145\/1583991"],"URL":"https:\/\/doi.org\/10.1145\/1583991.1584058","relation":{},"subject":[],"published":{"date-parts":[[2009,8,11]]},"assertion":[{"value":"2009-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}