The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs

Author:

Chang Yi-Jun1ORCID,Li Zeyong1ORCID

Affiliation:

1. National University of Singapore, Singapore, Singapore

Publisher

ACM

Reference63 articles.

1. Distributed dominating set approximations beyond planar graphs;Amiri Saeed Akhoondian;ACM Transactions on Algorithms (TALG),2019

2. Baruch Awerbuch , Andrew V. Goldberg , Michael Luby , and Serge A. Plotkin . 1989. Network Decomposition and Locality in Distributed Computation . In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS). 364--369 . Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, and Serge A. Plotkin. 1989. Network Decomposition and Locality in Distributed Computation. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science (FOCS). 364--369.

3. Nir Bachrach , Keren Censor-Hillel , Michal Dory , Yuval Efron , Dean Leitersdorf , and Ami Paz . 2019 . Hardness of Distributed Optimization . In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC). 238--247 . Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, and Ami Paz. 2019. Hardness of Distributed Optimization. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC). 238--247.

4. Alkida Balliu , Sebastian Brandt , Fabian Kuhn , and Dennis Olivetti . 2023 . Distributed Maximal Matching and Maximal Independent Set on Hypergraphs . In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2632--2676 . Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2023. Distributed Maximal Matching and Maximal Independent Set on Hypergraphs. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2632--2676.

5. Alkida Balliu , Fabian Kuhn , and Dennis Olivetti . 2022 . Improved Distributed Fractional Coloring Algorithms. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 217), Quentin Bramas, Vincent Gramoli, and Alessia Milani (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 18:1--18: 23 . 10.4230/LIPIcs.OPODIS.2021.18 Alkida Balliu, Fabian Kuhn, and Dennis Olivetti. 2022. Improved Distributed Fractional Coloring Algorithms. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 217), Quentin Bramas, Vincent Gramoli, and Alessia Milani (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 18:1--18:23. 10.4230/LIPIcs.OPODIS.2021.18

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. No Distributed Quantum Advantage for Approximate Graph Coloring;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3