CONSTRAINT BIPARTITE VERTEX COVER - Simpler exact algorithms and implementations

被引：0
|
作者：
Bai, Guoqiang [1 ]
Fernau, Henning [1 ]
机构：
[1] Univ Trier, FB Abt Informat 4, D-54286 Trier, Germany
来源：
FRONTIERS IN ALGORITHMICS | 2008年 / 5059卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
CONSTRAINT BIPARTITE VERTEX COVER is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situations.
引用
收藏
页码：67 / 78
页数：12
相关论文
共 50 条
  • [41] Enumerate and expand:: Improved algorithms for connected Vertex Cover and Tree Cover
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    THEORY OF COMPUTING SYSTEMS, 2008, 43 (02) : 234 - 253
  • [42] On efficient fixed parameter algorithms for WEIGHTED VERTEX COVER
    Niedermeier, R
    Rossmanith, P
    ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 180 - 191
  • [43] APPROXIMATION ALGORITHMS FOR THE SET COVERING AND VERTEX COVER PROBLEMS
    HOCHBAUM, DS
    SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 555 - 556
  • [44] Exact and Approximate Algorithms for the Most Connected Vertex Problem
    Sheng, Cheng
    Tao, Yufei
    Li, Jianzhong
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2012, 37 (02):
  • [45] A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
    Bodlaender, Hans L.
    Fomin, Fedor V.
    Koster, Arie M. C. A.
    Kratsch, Dieter
    Thilikos, Dimitrios M.
    THEORY OF COMPUTING SYSTEMS, 2012, 50 (03) : 420 - 432
  • [46] A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
    Hans L. Bodlaender
    Fedor V. Fomin
    Arie M. C. A. Koster
    Dieter Kratsch
    Dimitrios M. Thilikos
    Theory of Computing Systems, 2012, 50 : 420 - 432
  • [47] Improved approximation algorithms for the partial vertex cover problem
    Halperin, E
    Srinivasan, A
    APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2002, 2462 : 161 - 174
  • [48] On the applicability of Diploid Genetic Algorithms in Vertex Cover Problem
    Mohammad Amini
    Sonal Dwivedi
    Mohammad Akif Beg
    CSI Transactions on ICT, 2016, 4 (2-4) : 177 - 182
  • [49] Parameterized Reductions and Algorithms for Another Vertex Cover Generalization
    Damaschke, Peter
    Molokov, Leonid
    ALGORITHMS AND DATA STRUCTURES, 2011, 6844 : 279 - +
  • [50] Quantum Algorithms of the Vertex Cover Problem on a Quantum Computer
    Chang, Weng-Long
    Ren, Ting-Ting
    Feng, Mang
    Huang, Shu-Chien
    Lu, Lai Chin
    Lin, Kawuu Weicheng
    Guo, Minyi
    2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 100 - +
12345