VuKly9HRewP4nXUEjDK37PcjNRrr9Sc3JoZeSDodMdh0KIwZFBowC3Vfnqyr
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

Key Words:Cubic graph;Maximum vertex coverage;Approximation

First Author:周培衍

Document Code:1478209518247612418

Volume:888

Page Number:22-30

Number of Words:10

Translation or Not:No

Date of Publication:2021-10

Release Time:2023-11-09

Prev One:Minimize Maximum Coverage of Fragment Alignment Selection

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