An approximation algorithm or feedback vertex sets in tournaments
文献类型：期刊论文
| 作者 | Cai, MC; Deng, XT; Zang, WN |
| 刊名 | SIAM JOURNAL ON COMPUTING
 |
| 出版日期 | 2001 |
| 卷号 | 30期号:6页码:1993-2007 |
| 关键词 | feedback vertex set tournament min-max relation approximation algorithm |
| ISSN号 | 0097-5397 |
| 英文摘要 | We obtain a necessary and sufficient condition in terms of forbidden structures for tournaments to possess the min-max relation on packing and covering directed cycles, together with strongly polynomial time algorithms for the feedback vertex set problem and the cycle packing problem in this class of tournaments. Applying the local ratio technique of Bar-Yehuda and Even to the forbidden structures, we nd a 2.5-approximation polynomial time algorithm for the feedback vertex set problem in any tournament. |
| WOS研究方向 | Computer Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000169070000012 |
| 出版者 | SIAM PUBLICATIONS |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/16159]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | 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.Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China |
| 推荐引用方式 GB/T 7714 | Cai, MC,Deng, XT,Zang, WN. An approximation algorithm or feedback vertex sets in tournaments[J]. SIAM JOURNAL ON COMPUTING,2001,30(6):1993-2007. |
| APA | Cai, MC,Deng, XT,&Zang, WN.(2001).An approximation algorithm or feedback vertex sets in tournaments.SIAM JOURNAL ON COMPUTING,30(6),1993-2007. |
| MLA | Cai, MC,et al."An approximation algorithm or feedback vertex sets in tournaments".SIAM JOURNAL ON COMPUTING 30.6(2001):1993-2007. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。