Advertisement

An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

  • Henning Fernau
  • Rolf Niedermeier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1672)

Abstract

The “Constraint Bipartite Vertex Cover” problem (CBVC for short) is: given a bipartite graph G with n vertices and two positive integers k 1, k 2, is there a vertex cover taking at most k1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NP-complete. It formalizes the spare allocation problem for reconfigurable arrays, an important problem from VLSI manufacturing.

We provide the first nontrivial so-called “fixed parameter” algorithm for CBVC, running in time \( O(1.3999^{k_1 + k_2 } + (k_1 + k_2 )n) \). Our algorithm is efficient for small values of k 1 and k 2, as occurring in applications.

Keywords

Bipartite Graph Search Tree Exact Algorithm Vertex Cover Vertex Cover Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Balasubramanian, M. R. Fellows, and V. Raman. An improved fixed parameter algorithm for vertex cover. Inform. Process. Lett., 65(3):163–168, 1998.CrossRefMathSciNetGoogle Scholar
  2. 2.
    R. Beigel and D. Eppstein. 3-Coloring in time o(1.3446n): a no MIS algorithm. In Proc. of the 36th IEEE Conf. Found. of Comp. Sci., pp. 444–452, 1995.Google Scholar
  3. 3.
    R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.Google Scholar
  4. 4.
    R. G. Downey, M. R. Fellows, and U. Stege. Parameterized complexity: A framework for systematically confronting computational intractability. In F. Roberts, J. Kratochvíl, and J. Nešetřil, editors, Proc. of 1st DIMATIA Symposium, AMSDIMACS Proc. Series, 1997. To appear.Google Scholar
  5. 5.
    N. Hasan and C. L. Liu. Fault covers in reconfigurable PLAs. In 20th Int. Symp. on Fault-Tolerant Comput. Syst., pp. 166–173. IEEE Comp. Soc. Press, 1990.Google Scholar
  6. 6.
    S.-Y. Kuo and W. Fuchs. Efficient spare allocation for reconfigurable arrays. IEEE Design and Test, 4:24–31, Feb. 1987.CrossRefGoogle Scholar
  7. 7.
    R. Niedermeier. Some prospects for efficent fixed parameter algorithms (invited paper). In B. Rovan, editor, Proc. of the 25th SOFSEM Conf, number 1521 in Lect. Notes in Comp. Sci., pp. 168–185. Springer, 1998.Google Scholar
  8. 8.
    R. Niedermeier and P. Rossmanith. New upper bounds for MaxSat. Technical Report KAM-DIMATIA Series 98-401, Faculty of Mathematics and Physics, Charles University, Prague, July 1998. Extended abstract to appear at Proc. of the 26th Int. Coll. Automata, Lang., and Programming, Prague, July 1999.Google Scholar
  9. 9.
    R. Niedermeier and P. Rossmanith. Upper bounds for vertex cover further improved. Technical Report KAM-DIMATIA Series 98-411, Faculty of Mathematics and Physics, Charles University, Prague, Nov. 1998. An extended abstract appeared in: C. Meinel and S. Tison, editors, Proc. of the 16th Symp. Theoret. Aspects of Comp. Sci., number 1563 in Lect. Notes in Comp. Sci., pp. 561–570. Springer, 1999.Google Scholar
  10. 10.
    J. M. Robson. Algorithms for maximum independent sets. J. Algorithms, 7:425–440, 1986.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    R. Schroeppel and A. Shamir. AT= O(2n/2), S = O(2n/4) algorithm for certain NP-complete problems. SIAM J. Comput., 10(3):456–464, 1981.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    R. E. Tarjan and A. E. Trojanowski. Finding a Maximum Independent Set. SIAM J. Comput, 6(3):537–550, 1977.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Henning Fernau
    • 1
  • Rolf Niedermeier
    • 1
  1. 1.Wilhelm-Schickhard-Institut fur InformatikUniversität TübingenTübingenFed. Rep. of Germany

Personalised recommendations