Algorithm for Online 3-Path Vertex Cover-Reference-Cited by-同舟云学术

Algorithm for Online 3-Path Vertex Cover

Published:2019-07-24 Issue:2 Volume:64 Page:327-338
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Zhang Yubai,Zhang Zhao,Shi Yishuo,Li Xianyue

Funder

National Natural Science Foundation of China

Zhejiang Provincial Natural Science Foundation of China

Fundamental Research Funds for the Central Universities

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-019-09944-w.pdf

Reference24 articles.

1. Albers, S.: Online algorithms: a survey. Math. Program. 97(1–2), 3–26 (2003)

2. Birmelé, E., Delbot, F., Laforest, C.: Mean analysis of an online algorithm for the vertex cover problem. Inf. Process. Lett. 109(9), 436–439 (2009)

3. Boyar, J., Favrholdt, L.M., Kudahl, C., Larsen, K.S., Mikkelsen, J.W.: Online algorithms with advice: a survey. ACM Comput. Surv. 47(3), 93–129 (2016)

4. Brešar, B., Kardoš, F., Katrenič, J., Semanišin, G.: Minimum k-path vertex cover. Discret. Appl. Math. 159(12), 1189–1195 (2011)

5. Brešar, B., Krivoš-Belluš, R., Semanišin, G., Šparl, P.: On the weighted k-path vertex cover problem. Comput. Aided Des. 30(13), 983–989 (2014)

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

1. Delaying Decisions and Reservation Costs;Lecture Notes in Computer Science;2023-12-09

2. A Survey on the k-Path Vertex Cover Problem;Axioms;2022-04-20