Approximate multi-matroid intersection via iterative refinement-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Approximate multi-matroid intersection via iterative refinement

Published:2020-06-15 Issue:1-2 Volume:183 Page:397-418
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Math. Program.

Author:

Linhares André,Olver Neil,Swamy Chaitanya^ORCID,Zenklusen Rico

Funder

Natural Sciences and Engineering Research Council of Canada

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

https://link.springer.com/content/pdf/10.1007/s10107-020-01524-y.pdf

Reference25 articles.

1. Aharoni, R., Berger, E.: The intersection of a matroid and a simplicial complex. Trans. Am. Math. Soc. 358(11), 4895–4917 (2006)

2. Bansal, N., Khandekar, R., Könemann, J., Nagarajan, V., Peis, B.: On generalizations of network design problems with degree bounds. Math. Program. 141(1–2), 479–506 (2013)

3. Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree-bounded directed network design. SIAM J. Comput. 39(4), 1413–1431 (2009)

4. Chakrabarty, D., Swamy, C.: Approximation algorithms for minimum norm and ordered optimization problems. In: Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC), pp. 126–137 (2019)

5. Chan, Y.H., Lau, L.C.: On linear and semidefinite programming relaxations for hypergraphic matching. Math. Program. 135, 123–148 (2012)

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

1. Thin Trees for Laminar Families;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Proportionally Fair Matching with Multiple Groups;Graph-Theoretic Concepts in Computer Science;2023

3. Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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