乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T20:26:57Z","timestamp":1730320017944,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR project Stint","award":["ANR-13-BS02-0007"]},{"name":"ERC under European Union's Horizon 2020","award":["DISTRUCT 648527"]},{"name":"National Science Centre of Poland POLONEZ","award":["UMO-2015\/19\/P\/ST6\/03998"]},{"name":"MaxPlanck Institute of Informatics"},{"name":"European Associated Laboratory ``Structures in Combinatorics'","award":["LEA STRUCO"]},{"name":"Czech grant ERCCZ","award":["LL-1201"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210383","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T13:46:44Z","timestamp":1531403204000},"page":"143-151","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Distributed Domination on Graph Classes of Bounded Expansion"],"prefix":"10.1145","author":[{"given":"Saeed","family":"Akhoondian Amiri","sequence":"first","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbrucken, Germany"}]},{"given":"Patrice","family":"Ossona de Mendez","sequence":"additional","affiliation":[{"name":"CAMS (CNRS UMR 8557), EHESS, Paris, France"}]},{"given":"Roman","family":"Rabinovich","sequence":"additional","affiliation":[{"name":"Technische Universitaat Berlin, Berlin, Germany"}]},{"given":"Sebastian","family":"Siebertz","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/2591796.2591849"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/11561927_32"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1248377.1248381"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1145\/1150334.1150336"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/2933057.2933084"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/s00493-003-0025-0"},{"unstructured":"Baruch Awerbuch and David Peleg. 1990. Locality-sensitive resource allocation. Citeseer. Baruch Awerbuch and David Peleg. 1990. Locality-sensitive resource allocation. Citeseer.","key":"e_1_3_2_1_7_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/FSCS.1990.89572"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/FSCS.1990.89571"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1016\/j.ipl.2017.01.011"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1007\/s00446-009-0088-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/167088.167174"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/1281100.1281112"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/PL00012580"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1287\/moor.4.3.233"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1007\/978-3-540-87779-0_6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/ICC.1997.605303"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.5555\/523998.851141"},{"volume-title":"Somnath Sikdar, and Blair D Sullivan.","year":"2014","author":"Demaine Erik D","unstructured":"Erik D Demaine , Felix Reidl , Peter Rossmanith , Fernando S\u00e1nchez Villaamil , Somnath Sikdar, and Blair D Sullivan. 2014 . Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. arXiv preprint arXiv:1406.2587 (2014). Erik D Demaine, Felix Reidl, Peter Rossmanith, Fernando S\u00e1nchez Villaamil, Somnath Sikdar, and Blair D Sullivan. 2014. Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. arXiv preprint arXiv:1406.2587 (2014).","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/2591796.2591884"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/j.ejc.2012.12.004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/285055.285059"},{"volume-title":"Johnson","year":"1979","author":"Garey Michael R.","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and intractability: a guide to the theory of NP-completeness. WH Free. Co., San Fr ( 1979). Michael R. Garey and David S. Johnson. 1979. Computers and intractability: a guide to the theory of NP-completeness. WH Free. Co., San Fr (1979).","key":"e_1_3_2_1_23_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/3055399.3055471"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1007\/978-3-662-53174-7_23"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/2591796.2591851"},{"volume-title":"Algorithms-ESA","year":"2015","author":"Har-Peled Sariel","unstructured":"Sariel Har-Peled and Kent Quanrud . 2015. Approximation algorithms for polynomial-expansion and low-density graphs . In Algorithms-ESA 2015 . Springer , 717--728. Sariel Har-Peled and Kent Quanrud. 2015. Approximation algorithms for polynomial-expansion and low-density graphs. In Algorithms-ESA 2015. Springer, 717--728.","key":"e_1_3_2_1_27_1"},{"volume-title":"Fundamentals of domination in graphs","author":"Haynes Teresa W","unstructured":"Teresa W Haynes , Stephen Hedetniemi , and Peter Slater . 1998. Fundamentals of domination in graphs . CRC Press . Teresa W Haynes, Stephen Hedetniemi, and Peter Slater. 1998. Fundamentals of domination in graphs. CRC Press.","key":"e_1_3_2_1_28_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/2611462.2611504"},{"volume-title":"Complexity of computer computations","author":"Karp Richard M","unstructured":"Richard M Karp . 1972. Reducibility among combinatorial problems . In Complexity of computer computations . Springer , 85--103. Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85--103.","key":"e_1_3_2_1_31_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1023\/B:ORDE.0000026489.93166.cb"},{"key":"e_1_3_2_1_33_1","first-page":"1","article-title":"The Generalised Colouring Numbers on Classes of Bounded Expansion. In 41st International Symposium on Mathematical Foundations of Computer Science","volume":"85","author":"Kreutzer Stephan","year":"2016","unstructured":"Stephan Kreutzer , Micha\u0142 Pilipczuk , Roman Rabinovich , and Sebastian Siebertz . 2016 . The Generalised Colouring Numbers on Classes of Bounded Expansion. In 41st International Symposium on Mathematical Foundations of Computer Science , MFCS. 85 : 1 -- 85 :13. Stephan Kreutzer, Micha\u0142 Pilipczuk, Roman Rabinovich, and Sebastian Siebertz. 2016. The Generalised Colouring Numbers on Classes of Bounded Expansion. In 41st International Symposium on Mathematical Foundations of Computer Science, MFCS. 85:1--85:13.","journal-title":"MFCS."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/2742012"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1145\/224964.224990"},{"volume-title":"Distributed minimum dominating set approximations in restricted families of graphs. Distributed computing 26, 2","year":"2013","author":"Lenzen Christoph","unstructured":"Christoph Lenzen , Yvonne-Anne Pignolet , and Roger Wattenhofer . 2013. Distributed minimum dominating set approximations in restricted families of graphs. Distributed computing 26, 2 ( 2013 ), 119--137. Christoph Lenzen, Yvonne-Anne Pignolet, and Roger Wattenhofer. 2013. Distributed minimum dominating set approximations in restricted families of graphs. Distributed computing 26, 2 (2013), 119--137.","key":"e_1_3_2_1_36_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1007\/978-3-540-87779-0_27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.5555\/1888781.1888844"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1016\/0012-365X(75)90058-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1145\/185675.306789"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.1002\/rsa.3240060204"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1016\/j.ejc.2006.07.013"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1016\/j.ejc.2006.07.014"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1016\/j.ejc.2007.11.019"},{"doi-asserted-by":"crossref","unstructured":"Jaroslav Ne\u0161et\u0159il and Patrice Ossona de Mendez. 2012. Sparsity. Springer. Jaroslav Ne\u0161et\u0159il and Patrice Ossona de Mendez. 2012. Sparsity. Springer.","key":"e_1_3_2_1_45_1","DOI":"10.1007\/978-3-642-27875-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.1007\/s00446-015-0251-x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1016\/j.ejc.2011.09.008"},{"key":"e_1_3_2_1_48_1","series-title":"SIAM Monographs on discrete mathematics and applications 5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed computing: a locality sensitive approach","author":"Peleg David","year":"2000","unstructured":"David Peleg . 2000. Distributed computing: a locality sensitive approach . SIAM Monographs on discrete mathematics and applications 5 ( 2000 ). David Peleg. 2000. Distributed computing: a locality sensitive approach. SIAM Monographs on discrete mathematics and applications 5 (2000)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.1016\/S0166-218X(03)00368-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1145\/258533.258641"},{"volume":"98","volume-title":"IEEE Symposium on Computers and Communications","author":"Sivakumar R.","unstructured":"R. Sivakumar , B. Das , and V. Bharghavan . 1998. An improved spine-based infrastructure for routing in ad hoc networks . In IEEE Symposium on Computers and Communications , Vol. 98 . R. Sivakumar, B. Das, and V. Bharghavan. 1998. An improved spine-based infrastructure for routing in ad hoc networks. In IEEE Symposium on Computers and Communications, Vol. 98.","key":"e_1_3_2_1_51_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_52_1","DOI":"10.1109\/71.980024"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_53_1","DOI":"10.1145\/1044731.1044732"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_54_1","DOI":"10.7155\/jgaa.00354"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_55_1","DOI":"10.1016\/j.ejc.2017.06.019"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_56_1","DOI":"10.1016\/S0743-7315(03)00040-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_57_1","DOI":"10.1016\/j.ipl.2013.11.008"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_58_1","DOI":"10.1145\/313239.313261"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_59_1","DOI":"10.1016\/j.disc.2008.03.024"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"acronym":"SPAA '18","name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Vienna Austria"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T13:01:44Z","timestamp":1673442104000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":58,"alternative-id":["10.1145\/3210377.3210383","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210383","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}