Online Algorithms for Maximum Cardinality Matching with Edge Arrivals-Reference-Cited by-同舟云学术

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

Online Algorithms for Maximum Cardinality Matching with Edge Arrivals

Published:2018-08-27 Issue:5 Volume:81 Page:1781-1799
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Buchbinder Niv,Segev Danny^ORCID,Tkach Yevgeny

Funder

Israel Science Foundation

United States-Israel Binational Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-018-0505-7.pdf

Reference20 articles.

1. Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1253–1264 (2011)

2. Azar, Y., Cohen, I.R., Roytman, A.: Online lower bounds via duality. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1038–1050 (2017)

3. Buchbinder, N., Jain, K., Naor, J.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Proceedings of the 15th Annual European Symposium on Algorithms, pp. 253–264 (2007)

4. Chiplunkar, A., Tirodkar, S., Vishwanathan, S.: On randomized algorithms for matching in the online preemptive model. In: Proceedings of the 23rd Annual European Symposium on Algorithms, pp. 325–336 (2015)

5. Devanur, N.R., Hayes, T.P.: The adwords problem: online keyword matching with budgeted bidders under random permutations. In: Proceedings 10th ACM Conference on Electronic Commerce, pp. 71–78 (2009)

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

1. AdWords in a Panorama;SIAM Journal on Computing;2024-06-17

2. Computing maximum matchings in temporal graphs;Journal of Computer and System Sciences;2023-11

3. Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark;Proceedings of the 23rd ACM Conference on Economics and Computation;2022-07-12

4. Deterministic (1+ )-approximate maximum matching with poly(1/ ) passes in the semi-streaming model and beyond;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. Computing Maximum Matchings in Temporal Graphs;SSRN Electronic Journal;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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