Approximate Generalized Matching: f-Matchings and f-Edge Covers-Reference-Cited by-同舟云学术

Approximate Generalized Matching: f-Matchings and f-Edge Covers

Published:2022-02-25 Issue:7 Volume:84 Page:1952-1992
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Huang Dawei^ORCID,Pettie Seth

Funder

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00453-022-00949-5.pdf

Reference28 articles.

1. Choromanski, K., Jebara, T., Tang, K.: Adaptive anonymity via $$b$$-matching. In: Advances in Neural Information Processing Systems 27: 27th Annual Conference on Neural Information Processing System, NIPS 2013, pp. 3192–3200 (2013)

2. Chvátal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4, 233–235 (1979)

3. Drake, D.E., Hougardy, S.: A simple approximation algorithm for the weighted matching problem. Inf. Process. Lett. 85, 211–213 (2003)

4. Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. J. ACM 61, 1:1-1:23 (2014)

5. Duan, R., Pettie, S., Su, H.: Scaling algorithms for weighted matching in general graphs. ACM Trans. Algor. 14, 8:1-8:35 (2018)

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

1. Generalized Matching;3D Computer Vision;2024

2. A Weight-Scaling Algorithm for f-Factors of Multigraphs;Algorithmica;2023-05-18

3. Blocking Trails for f-factors of Multigraphs;Algorithmica;2023-05-13

4. Approximate Core Allocations for Edge Cover Games;Frontiers of Algorithmics;2023