Book ChapterDOI
Vertex Cover: Further Observations and Further Improvements
Jianer Chen,Iyad A. Kanj,Weijia Jia +2 more
- pp 313-324
Reads0
Chats0
TLDR
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.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:271kk2) for the problem. Our algorithm also induces improvement on previous algorithms for the INDEPENDENT SET problem on graphs of small degree.read more
Citations
More filters
Book
Parameterized Algorithms
Marek Cygan,Fedor V. Fomin,Lukasz Kowalik,Daniel Lokshtanov,Dániel Marx,Marcin Pilipczuk,Michał Pilipczuk,Saket Saurabh +7 more
TL;DR: This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area, providing a toolbox of algorithmic techniques.
Journal ArticleDOI
Book review: Invitation to fixed-parameter algorithms
TL;DR: This is a review of the recent book by Rolf Niedermeier on fixed-parameter algorithms that contains a critical description of the covered material, a comparison with other books dedicated to the same field and an evaluation of its contribution as a monograph to the theoretical computer science community.
Book ChapterDOI
Exact algorithms for NP-hard problems: a survey
TL;DR: The list of discussed NP-complete problems includes the traveling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more as discussed by the authors.
Book ChapterDOI
A Gentle Introduction to Memetic Algorithms
Pablo Moscato,Carlos Cotta +1 more
TL;DR: The generic denomination of ‘Memetic Algorithms’ (MAs) is used to encompass a broad class of metaheuristics (i.e. general purpose methods aimed to guide an underlying heuristic) and proved to be of practical success in a variety of problem domains and in particular for the approximate solution of NP Optimization problems.
Journal ArticleDOI
Vertex Cover
TL;DR: This paper introduces several simple and new techniques that lead to an improved algorithm of time O(kn+1.2852k) for the Vertex Cover problem, and induces improvement on previous algorithms for the Independent Set problem on graphs of small degree.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Book
Parameterized Complexity
TL;DR: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.