A min-max theorem on feedback vertex sets

CSpace

	A min-max theorem on feedback vertex sets
	Cai, MC ; Deng, XT ; Zang, WN
	2002-05-01
发表期刊	MATHEMATICS OF OPERATIONS RESEARCH
ISSN	0364-765X
卷号	27 期号:2 页码:361-371
摘要	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 totally dual integral, 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 min-max theorem.
关键词	feedback vertex set bipartite tournament totally dual integrality min-max relation approximation algorithm
语种	英语
WOS研究方向	Operations Research & Management Science ; Mathematics
WOS类目	Operations Research & Management Science ; Mathematics, Applied
WOS记录号	WOS:000176534700008
出版者	INST OPERATIONS RESEARCH MANAGEMENT SCIENCES
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17824
专题	中国科学院数学与系统科学研究院
通讯作者	Cai, MC
作者单位	1.Acad Sinica, Inst Syst Sci, Acad Math & 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. A min-max theorem on feedback vertex sets[J]. MATHEMATICS OF OPERATIONS RESEARCH,2002,27(2):361-371.
APA	Cai, MC,Deng, XT,&Zang, WN.(2002).A min-max theorem on feedback vertex sets.MATHEMATICS OF OPERATIONS RESEARCH,27(2),361-371.
MLA	Cai, MC,et al."A min-max theorem on feedback vertex sets".MATHEMATICS OF OPERATIONS RESEARCH 27.2(2002):361-371.