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

Minimize Maximum Coverage of Fragment Alignment Selection

Hits:

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

First Author:王雨阳

Document Code:7ECBD23931B94DDD9454DB0247D48C03

Number of Words:5

Translation or Not:no

Date of Publication:2023-12-05

Pre One:Approximation algorithms for sorting by bounded singleton moves

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