An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
IEEE Transactions on Computers
SIAM Journal on Computing
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Exact Algorithms for MAX-SAT
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
ICDT'07 Proceedings of the 11th international conference on Database Theory
A new approach for solving the maximum clique problem
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Memetic algorithms with partial lamarckism for the shortest common supersequence problem
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
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:271kk2) for the problem. Our algorithm also induces improvement on previous algorithms for the INDEPENDENT SET problem on graphs of small degree.