Journal of the ACM (JACM)
The hardness of approximation: gap location
Computational Complexity
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Vertex cover: further observations and further improvements
Journal of Algorithms
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Computing small partial coverings
Information Processing Letters
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Improved upper bounds for 3-SAT
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Refined memorization 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
Enumerate and expand: improved algorithms for connected vertex cover and tree cover
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
A faster algorithm for the steiner tree problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Triangles, 4-cycles and parameterized (in-)tractability
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithms based on the treewidth of sparse graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Random separation: a new method for solving fixed-cardinality optimization problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity
Partial vs. Complete Domination: t-Dominating Set
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Improved Upper Bounds for Partial Vertex Cover
Graph-Theoretic Concepts in Computer Science
The curse of connectivity: t-total vertex (edge) cover
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Subexponential algorithms for partial cover problems
Information Processing Letters
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences
Hi-index | 0.00 |
Many interesting results that improve on the exponential running times of exact algorithms for NP-hard problems have been obtained in recent years. One example that has attracted quite some attention of late is t-Vertex Cover, the problem of finding k nodes that cover at least t edges in a graph. Following the first proof of fixed-parameter tractability, several algorithms for this problem have been presented in rapid succession. We improve on the best known runtime bound, designing and analyzing an intuitive randomized algorithm that takes no more than O(2.0911tn4) steps. In fact, we observe and encourage a renewed vigor towards the design of intuitive algorithms within the community. That is, we make a plea to prefer simple, comprehendable, easy-to-implement and easy-to-verify algorithms at the expense of a more involved analysis over more complicated algorithms that are specifically tailored to ease the analysis.