A new approach to the maximum-flow problem
Journal of the ACM (JACM)
SIAM Journal on Computing
Vertex cover: further observations and further improvements
Journal of Algorithms
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the number of vertices belonging to all maximum stable sets of a graph
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover
Discrete Applied Mathematics
Fast, effective vertex cover kernelization: a tale of two algorithms
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
Journal of Discrete Algorithms
Improved upper bounds for vertex cover
Theoretical Computer Science
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
A kernel of order 2k-clogk for vertex cover
Information Processing Letters
On bounded block decomposition problems for under-specified systems of equations
Journal of Computer and System Sciences
Discrete Optimization
Vertices Belonging to All Critical Sets of a Graph
SIAM Journal on Discrete Mathematics
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
Fast fusion moves for multi-model estimation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
European Journal of Combinatorics
d-Transversals of stable sets and vertex covers in weighted bipartite graphs
Journal of Discrete Algorithms
Hi-index | 0.05 |
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG'03), Lecture notes in computer science, vol. 2880, 2003, pp. 1-12, Kernelization algorithms for the vertex cover problem: theory and experiments, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, January 2004, pp. 62-69]. We describe in detail a close relation of crown reductions to Nemhauser and Trotter reductions that are based on the linear programming relaxation of the problem. We introduce and study the so-called strong crown reductions, suitable for finding (or counting) all minimum vertex covers, or finding a minimum vertex cover under some additional constraints. It is described how crown decompositions and strong crown decompositions suitable for such problems can be computed in polynomial time. For weighted Konig-Egervary graphs (G,w) we observe that the set of vertices belonging to all minimum vertex covers, and the set of vertices belonging to no minimum vertex covers, can be efficiently computed. Further, for some specific classes of graphs, simple algorithms for the MIN-VC problem with a constant approximation factor r