tX2y3x2kl7r4NYOrQVxTZ44TJpiJ6Zs2QEJmyKkgd5ULqdBmgFGGjoVFBh1O
Current position: Home >> Scientific Research >> Paper Publications

Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs

Hits:

Institution:计算机科学与技术学院

Title of Paper:Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs

Journal:Theoretical Computer Science

First Author:周培衍

Document Code:023033710A1846F3B2E0B9438A6DEA58

Volume:888

Page Number:22

Number of Words:10

Translation or Not:No

Date of Publication:2021-10

Release Time:2022-10-20

Prev One:Can a breakpoint graph be decomposed into none other than 2-cycles?

Next One:Sorting a Permutation by Best Short Swaps