KMS Of Academy of mathematics and systems sciences, CAS
A min-max theorem on tournaments | |
Chen, Xujin![]() ![]() | |
2007 | |
Source Publication | SIAM JOURNAL ON COMPUTING
![]() |
ISSN | 0097-5397 |
Volume | 37Issue:3Pages:923-937 |
Abstract | We present a structural characterization of all tournaments T = ( V, A) such that, for any nonnegative integral weight function defined on V, the maximum size of a feedback vertex set packing is equal to the minimum weight of a triangle in T. We also answer a question of Frank by showing that it is NP- complete to decide whether the vertex set of a given tournament can be partitioned into two feedback vertex sets. In addition, we give exact and approximation algorithms for the feedback vertex set packing problem on tournaments. |
Keyword | min-max relation feedback vertex set tournament packing covering |
DOI | 10.1137/060649987 |
Language | 英语 |
WOS Research Area | Computer Science ; Mathematics |
WOS Subject | Computer Science, Theory & Methods ; Mathematics, Applied |
WOS ID | WOS:000249690800011 |
Publisher | SIAM PUBLICATIONS |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/4731 |
Collection | 应用数学研究所 |
Corresponding Author | Chen, Xujin |
Affiliation | 1.Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China 2.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China |
Recommended Citation GB/T 7714 | Chen, Xujin,Hu, Xiaodong,Zang, Wenan. A min-max theorem on tournaments[J]. SIAM JOURNAL ON COMPUTING,2007,37(3):923-937. |
APA | Chen, Xujin,Hu, Xiaodong,&Zang, Wenan.(2007).A min-max theorem on tournaments.SIAM JOURNAL ON COMPUTING,37(3),923-937. |
MLA | Chen, Xujin,et al."A min-max theorem on tournaments".SIAM JOURNAL ON COMPUTING 37.3(2007):923-937. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment