| Title | Vertex cover: Further observations and further improvements |
| Creator | |
| Date Issued | 1999 |
| Conference Name | 25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1999 |
| Source Publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
 |
| ISBN | 3540667318; 9783540667315 |
| ISSN | 0302-9743 |
| Volume | 1665 |
| Pages | 313-324 |
| Conference Date | JUN 17-19, 1999 |
| Conference Place | Ascona, Switzerland |
| Publisher | Springer Verlag |
| Abstract | Recently, there have been increasing interests and progresses in lowering the worst case time complexity for well-known NP-hard problems, in particular for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated and several new techniques are introduced, which lead to a simpler and improved algorithm of time complexity O(kn + 1.271k k2) for the problem. Our algorithm also induces improvement on previous algorithms for the Independent Set problem on graphs of small degree. © Springer-Verlag Berlin Heidelberg 1999. |
| DOI | 10.1007/3-540-46784-x_30 |
| URL | View source |
| Language | 英语English |
| Citation statistics |
Cited Times [WOS]:0
[WOS Record]
[Related Records in WOS]
|
| Document Type | Conference paper |
| Identifier | http://repository.uic.edu.cn/handle/39GCC9TT/4667 |
| Collection | Research outside affiliated institution |
| Affiliation | 1.Dept. of Computer Science, Texas A and M University, College Station, TX, United States 2.Dept. of Computer Science, City University of HongKong, Hong Kong |
| Recommended Citation GB/T 7714 | Chen, Jianâer,Kanj, Iyad A.,Jia, Weijia. Vertex cover: Further observations and further improvements[C]: Springer Verlag, 1999: 313-324. |
| 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.
BNBU 
Library
Edit Comment