An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
3-coloring in time 0(1.3446^n): a no-MIS algorithm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Efficient Spare Allocation for Reconfigurable Arrays
IEEE Design & Test
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parameterized Complexity
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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
| Hi-index | 0.00 |
The "Constraint Bipartite Vertex Cover" problem (CBVC for short) is: given a bipartite graph G with n vertices and two positive integers k1, k2, is there a vertex cover taking at most k1 vertices from one and at most k2 vertices from the other vertex set of G? CBVC is NP-complete. It formalizes the spare allocation problem for reconfigurable axrays, an important problem from VLSI manufacturing. We provide the first nontrivial so-called "fixed parameter" algorithm for CBVC, running in time O(1.3999k1+k2 + (k1+k2n). Our algorithm is efficient for small values of k1 and k2, as occurring in applications.