A min-max theorem on feedback vertex sets (Preliminary version)
文献类型：期刊论文
| 作者 | Cai, MC; Deng, XT; Zang, WN |
| 刊名 | INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
 |
| 出版日期 | 1999 |
| 卷号 | 1610页码:73-86 |
| 关键词 | feedback vertex set bipartite tournament totally dual integrality min-max relation approximation algorithm |
| ISSN号 | 0302-9743 |
| 英文摘要 | We establish a necessary and sufficient condition for the linear system {x : Hx greater than or equal to e, x greater than or equal to 0} associated with a bipartite tournament to be TDI, where H is the cycle-vertex incidence matrix and e is the all-one vector. The consequence is a min-max relation on packing and covering cycles, together with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem on the corresponding bipartite tournaments. In addition, we show that the feedback vertex set problem on general bipartite tournaments is NP-complete and approximable within 3.5 based on the max-min theorem. |
| WOS研究方向 | Computer Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000086108800006 |
| 出版者 | SPRINGER-VERLAG BERLIN |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/14699]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Cai, MC |
| 作者单位 | 1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China 2.City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China 3.City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China |
| 推荐引用方式 GB/T 7714 | Cai, MC,Deng, XT,Zang, WN. A min-max theorem on feedback vertex sets (Preliminary version)[J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION,1999,1610:73-86. |
| APA | Cai, MC,Deng, XT,&Zang, WN.(1999).A min-max theorem on feedback vertex sets (Preliminary version).INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION,1610,73-86. |
| MLA | Cai, MC,et al."A min-max theorem on feedback vertex sets (Preliminary version)".INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION 1610(1999):73-86. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。