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 条
  • [21] 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
  • [22] No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover
    Goos, Mika
    Suomela, Jukka
    DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 181 - 194
  • [23] Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight
    Jansen, Bart M. P.
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [24] ON THE HILBERT SERIES OF VERTEX COVER ALGEBRAS OF UNMIXED BIPARTITE GRAPHS
    Ion, Cristian
    MATHEMATICAL REPORTS, 2011, 13 (04): : 337 - 346
  • [25] 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
  • [26] No sublogarithmic-time approximation scheme for bipartite vertex cover
    Goeoes, Mika
    Suomela, Jukka
    DISTRIBUTED COMPUTING, 2014, 27 (06) : 435 - 443
  • [27] PARTIAL VERTEX COVER AND BUDGETED MAXIMUM COVERAGE IN BIPARTITE GRAPHS
    Caskurlu, Bugra
    Mkrtchyan, Vahan
    Parekh, Ojas
    Subramani, K.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (03) : 2172 - 2184
  • [28] Approximation algorithms for the partition vertex cover problem
    Bera, Suman K.
    Gupta, Shalmoli
    Kumar, Amit
    Roy, Sambuddha
    THEORETICAL COMPUTER SCIENCE, 2014, 555 : 2 - 8
  • [29] Parameterized algorithms for minimum sum vertex cover
    Aute, Shubhada
    Panolan, Fahad
    THEORETICAL COMPUTER SCIENCE, 2025, 1029
  • [30] Parameterized approximation algorithms for weighted vertex cover
    Mandal, Soumen
    Misra, Pranabendu
    Rai, Ashutosh
    Saurabh, Saket
    THEORETICAL COMPUTER SCIENCE, 2024, 1021
12345