{"id":"https://openalex.org/W4380881055","doi":"https://doi.org/10.1145/3583668.3594562","title":"The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs","display_name":"The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380881055","doi":"https://doi.org/10.1145/3583668.3594562"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594562","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594562","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594562","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594562","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061847213","display_name":"Yi\u2010Jun Chang","orcid":"https://orcid.org/0000-0002-0109-2432"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Yi-Jun Chang","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-0109-2432","affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035809548","display_name":"Zeyong Li","orcid":"https://orcid.org/0009-0004-8121-5149"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Zeyong Li","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"raw_orcid":"https://orcid.org/0009-0004-8121-5149","affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061847213"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":0.7759,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75063064,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"32","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.7631450891494751},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6519014835357666},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5079534649848938},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4978618621826172},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4954789876937866},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4748428165912628},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.456841379404068},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4475925862789154},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44182658195495605},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36682939529418945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34806108474731445},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3027906119823456},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.21426096558570862}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.7631450891494751},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6519014835357666},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5079534649848938},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4978618621826172},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4954789876937866},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4748428165912628},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.456841379404068},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4475925862789154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44182658195495605},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36682939529418945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34806108474731445},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3027906119823456},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.21426096558570862},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583668.3594562","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594562","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594562","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583668.3594562","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594562","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594562","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4380881055.pdf","grobid_xml":"https://content.openalex.org/works/W4380881055.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W1534484868","https://openalex.org/W1565291260","https://openalex.org/W1869515244","https://openalex.org/W1957963525","https://openalex.org/W1977066974","https://openalex.org/W1979561519","https://openalex.org/W1993913882","https://openalex.org/W2025919541","https://openalex.org/W2054910423","https://openalex.org/W2062135503","https://openalex.org/W2160532428","https://openalex.org/W2275325805","https://openalex.org/W2476017094","https://openalex.org/W2503099161","https://openalex.org/W2503706701","https://openalex.org/W2552279664","https://openalex.org/W2594542601","https://openalex.org/W2738712979","https://openalex.org/W2963424691","https://openalex.org/W2963550269","https://openalex.org/W2963612177","https://openalex.org/W2963840696","https://openalex.org/W2963948964","https://openalex.org/W2963962070","https://openalex.org/W2966325631","https://openalex.org/W2970822208","https://openalex.org/W2982699376","https://openalex.org/W2998224451","https://openalex.org/W3034790637","https://openalex.org/W3043405145","https://openalex.org/W3046349810","https://openalex.org/W3046532547","https://openalex.org/W3104625252","https://openalex.org/W3114868980","https://openalex.org/W3117607498","https://openalex.org/W3127810600","https://openalex.org/W3162824550","https://openalex.org/W3185108837","https://openalex.org/W3210810470","https://openalex.org/W3214332583","https://openalex.org/W4254031789","https://openalex.org/W4255054927","https://openalex.org/W4282006258","https://openalex.org/W4286501294","https://openalex.org/W4297163599","https://openalex.org/W4316652274","https://openalex.org/W4380881055","https://openalex.org/W4385713939"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W1862126075","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W4389362338","https://openalex.org/W1968512104","https://openalex.org/W4299801389","https://openalex.org/W2565109825"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,24],"present":[4],"a":[5],"low-diameter":[6,35],"decomposition":[7,36],"algorithm":[8],"in":[9,37],"the":[10],"LOCAL":[11],"model":[12],"of":[13],"distributed":[14],"computing":[15],"that":[16],"succeeds":[17],"with":[18],"probability":[19],"1":[20],"\u2212":[21],"1/poly(n).":[22],"Specifically,":[23],"show":[25],"how":[26],"to":[27],"compute":[28],"an":[29],"(\u03f5,":[30],"O((log":[31],"n)":[32,40],"/":[33,41],"\u03f5))":[34],"O((log3(1/\u03f5)":[38],"log":[39],"\u03f5)":[42],"rounds.":[43]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}