A new efficient algorithm for weighted vertex cover in bipartite graphs based on a dual problem

被引：3
|
作者：
Zhang Yujiao [1 ]
Duan Xia [1 ]
Yue Xuerong [1 ]
Chen Zhibin [1 ]
机构：
[1] Kunming Univ Sci & Technol, Dept Math, Fac Sci, Kunming, Yunnan, Peoples R China
来源：
2018 NINTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY IN MEDICINE AND EDUCATION (ITME 2018) | 2018年
基金：
中国国家自然科学基金;
关键词：
matching; vertex cover; edge packing; polynomial time algorithm; dual problem;
D O I：
10.1109/ITME.2018.00016
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The (un-weighted) vertex cover problem in general graphs is a classical NP-hard problem, but it is polynomial time solvable in bipartite graphs. This paper considers two combinatorial optimization problems. One is the weighted vertex cover problem and the other is the so-called maximum edge packing problem. We proved that in bipartite graphs, maximum edge packing problem can be viewed as the dual of the weighted vertex cover problem, and hence these two problems are polynomial time solvable. We explored the relationships between these two problems in bipartite graphs and some structural results are obtained accordingly. Furthermore, a new efficient algorithm for the weighted vertex cover problem in bipartite graphs is also derived. Our method generalized some previous algorithms for un-weighted vertex cover in bipartite graphs.
引用
收藏
页码：20 / 23
页数：4
相关论文
共 50 条
  • [1] An approximation algorithm for weighted weak vertex cover problem in undirected graphs
    Zhang, Y
    Zhu, H
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 143 - 150
  • [2] On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
    Vahan Mkrtchyan
    Garik Petrosyan
    K. Subramani
    Piotr Wojciechowski
    Theory of Computing Systems, 2024, 68 : 122 - 143
  • [3] On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
    Mkrtchyan, Vahan
    Petrosyan, Garik
    Subramani, K.
    Wojciechowski, Piotr
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (01) : 122 - 143
  • [4] An efficient exact algorithm for constraint bipartite vertex cover
    Fernau, H
    Niedermeier, R
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 38 (02): : 374 - 410
  • [5] An effective algorithm for minimum weighted vertex cover problem
    Balaji, S.
    Swaminathan, V.
    Kannan, K.
    International Journal of Computational and Mathematical Sciences, 2010, 4 (01): : 34 - 38
  • [6] An effective algorithm for minimum weighted vertex cover problem
    Balaji, S.
    Swaminathan, V.
    Kannan, K.
    World Academy of Science, Engineering and Technology, 2010, 43 : 315 - 319
  • [7] A PARALLEL ALGORITHM FOR THE MINIMUM WEIGHTED VERTEX COVER PROBLEM
    LIKAS, A
    STAFYLOPATIS, A
    INFORMATION PROCESSING LETTERS, 1995, 53 (04) : 229 - 234
  • [8] An effective algorithm for minimum weighted vertex cover problem
    Balaji, S.
    Swaminathan, V.
    Kannan, K.
    World Academy of Science, Engineering and Technology, 2010, 67 : 315 - 319
  • [9] KOSZULNESS OF VERTEX COVER ALGEBRAS OF BIPARTITE GRAPHS
    Rinaldo, Giancarlo
    COMMUNICATIONS IN ALGEBRA, 2011, 39 (07) : 2249 - 2259
  • [10] Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs
    Jena, Sangram K.
    Subramani, K.
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 103 - 115
12345