Vertex Cover: Further Observations and Further Improvements

doi:10.1006/jagm.2001.1186

科研成果详情

发表状态	已发表Published
题名	Vertex Cover: Further Observations and Further Improvements
作者	Chen, Jianâer 1; Kanj, Iyad A.2; Jia, Weijia3
发表日期	2001
发表期刊	Journal of Algorithms
ISSN/eISSN	0196-6774
卷号	41 期号:2 页码:280-301
摘要	Recently, there has been increasing interest and progress in lowering the worst-case time complexity for well-known NP-hard problems, particularly for the VERTEX COVER problem. In this paper, new properties for the VERTEX COVER problem are indicated, and several simple and new techniques are introduced, which lead to an improved algorithm of time O(kn + 1.2852k) for the problem. Our algorithm also induces improvement on previous algorithms for the INDEPENDENT SET problem on graphs of small degree. © 2001 Elsevier Science.
DOI	10.1006/jagm.2001.1186
URL	查看来源
收录类别	SCIE
语种	英语English
WOS研究方向	Computer Science ; Mathematics ; Science & Technology - Other Topics
WOS类目	Computer Science, Theory & Methods ; Mathematics, Applied ; Logic
WOS记录号	WOS:000172706500007
引用统计
文献类型	期刊论文
条目标识符	https://repository.uic.edu.cn/handle/39GCC9TT/2016
专题	个人在本单位外知识产出
通讯作者	Chen, Jianâer
作者单位	1.Department of Computer Science, Texas A and M University, College Station, TX 77843-3112, United States 2.School of CTI, DePaul University, Chicago, IL 60604, 243 S. Wabash Avenue, United States 3.Department of Computer Science, City University of Hong Kong, Hong Kong SAR, China
推荐引用方式 GB/T 7714	Chen, Jianâer,Kanj, Iyad A.,Jia, Weijia. Vertex Cover: Further Observations and Further Improvements[J]. Journal of Algorithms, 2001, 41(2): 280-301.
APA	Chen, Jianâer, Kanj, Iyad A., & Jia, Weijia. (2001). Vertex Cover: Further Observations and Further Improvements. Journal of Algorithms, 41(2), 280-301.
MLA	Chen, Jianâer,et al."Vertex Cover: Further Observations and Further Improvements". Journal of Algorithms 41.2(2001): 280-301.