NR9PpAime6T93uhfYQ6MxPL1bQY9bg7Kv4jQ3D97ODu0BPJJqTsBhYalf0Gw

Paper Publications

Home >> Scientific Research >> Paper Publications

New approximation algorithms for the rooted Budgeted Cycle Cover problem

Release Time:2023-05-23| Hits:

Institution:软件学院

Title of Paper:New approximation algorithms for the rooted Budgeted Cycle Cover problem

Journal:Theoretical Computer Science

First Author:李江坤

Document Code:2FF0B62B42074AD7B32EBB70A6B039F4

Issue:940

Number of Words:12

Translation or Not:No

Date of Publication:2023-05

Release Time:2023-05-23

Prev One:
A (1.4+epsilon)-approximation algorithm for the 2-MAX-DUO problem
Next One:
New algorithms for a simple measure of network partitioning

中文    |   MOBILE Version   |   Login   |   SDU   

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

The Open Time: --

The Last Update Time: --