location： Current position: Home >> Scientific Research >> Paper Publications

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

Hits:

Affiliation of Author(s):计算机科学与技术学院

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-04

Pre One:Minimize Maximum Coverage of Fragment Alignment Selection

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

Copyright All Rights Reserved Shandong University Address: No. 27 Shanda South Road, Jinan City, Shandong Province, China: 250100
Information desk: (86) - 0531-88395114
On Duty Telephone: (86) - 0531-88364731 Construction and Maintenance: Information Work Office of Shandong University

Click:Times MOBILE Version
The Founding Time : ..
The Last Update Time : ..

Mobile phone sweep