Lossy Kernelization for (Implicit) Hitting Set Problems

被引：0
|
作者：
Fomin, Fedor V. [1 ]
Le, Tien-Nam [2 ]
Lokshtanov, Daniel [3 ]
Saurabh, Saket [1 ,4 ]
Thomassé, Stéphan [2 ]
Zehavi, Meirav [5 ]
机构：
[1] University of Bergen, Bergen, Norway
[2] École Normale Supérieure de Lyon, Lyon, France
[3] University of California, Santa Barbara, United States
[4] The Institute of Mathematical Sciences, HBNI, Chennai, India
[5] Ben-Gurion University of the Negev, Beersheba, Israel
来源：
arXiv | 2023年
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Approximation algorithms
引用
收藏
相关论文
共 50 条
  • [1] Lossy Kernelization for (Implicit) Hitting Set Problems
    Fomin, Fedor V.
    Le, Tien-Nam
    Lokshtanov, Daniel
    Saurabh, Saket
    Thomassé, Stéphan
    Zehavi, Meirav
    Leibniz International Proceedings in Informatics, LIPIcs, 2023, 274
  • [2] Kernelization algorithms for d-hitting set problems
    Abu-Khzam, Faisal N.
    Algorithms and Data Structures, Proceedings, 2007, 4619 : 434 - 445
  • [3] Algorithms for Implicit Hitting Set Problems
    Chandrasekaran, Karthekeyan
    Karp, Richard
    Moreno-Centeno, Erick
    Vempala, Santosh
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 614 - 629
  • [4] A kernelization algorithm for d-Hitting Set
    Abu-Khzam, Faisal N.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (07) : 524 - 531
  • [5] On the Lossy Kernelization for Connected Treedepth Deletion Set
    Eiben, Eduard
    Majumdar, Diptapriyo
    Ramanujan, M. S.
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 201 - 214
  • [6] Implicit Hitting Set Problems and Multi-genome Alignment
    Karp, Richard M.
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2010, 6129 : 151 - 151
  • [7] Towards Optimal and Expressive Kernelization for d-Hitting Set
    van Bevern, Rene
    ALGORITHMICA, 2014, 70 (01) : 129 - 147
  • [8] Lossy Kernelization
    Lokshtanov, Daniel
    Panolan, Fahad
    Ramanujan, M. S.
    Saurabh, Saket
    STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 224 - 237
  • [9] Towards Optimal and Expressive Kernelization for d-Hitting Set
    René van Bevern
    Algorithmica, 2014, 70 : 129 - 147
  • [10] Subquadratic Kernels for Implicit 3-HITTING SET and 3-SET PACKING Problems
    Le, Tien-Nam
    Lokshtanov, Daniel
    Saurabh, Saket
    Thomasse, Stephan
    Zehavi, Meirav
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 331 - 342
12345