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 条
  • [11] Subquadratic Kernels for Implicit 3-HITTING SET and 3-SET PACKING Problems
    Fomin, Fedor, V
    Le, Tien-Nam
    Lokshtanov, Daniel
    Saurabh, Saket
    Thomasse, Stephan
    Zehavi, Meirav
    ACM TRANSACTIONS ON ALGORITHMS, 2019, 15 (01)
  • [12] The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment
    Moreno-Centeno, Erick
    Karp, Richard M.
    OPERATIONS RESEARCH, 2013, 61 (02) : 453 - 468
  • [13] Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU
    van Bevern, Rene
    Kirilin, Artem M.
    Skachkov, Daniel A.
    Smirnov, Pavel V.
    Tsidulko, Oxana Yu.
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2024, 139
  • [14] Hitting forbidden minors: Approximation and Kernelization
    Fomin, Fedor V.
    Lokshtanov, Daniel
    Misra, Neeldhara
    Philip, Geevarghese
    Saurabh, Saket
    28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 189 - 200
  • [15] Implicit Hitting Set Algorithms for Reasoning Beyond NP
    Saikko, Paul
    Wallner, Johannes P.
    Jarvisalo, Matti
    FIFTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2016, : 104 - 113
  • [16] Abstract Cores in Implicit Hitting Set MaxSat Solving
    Berg, Jeremias
    Bacchus, Fahiem
    Poole, Alex
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, SAT 2020, 2020, 12178 : 277 - 294
  • [17] HITTING FORBIDDEN MINORS: APPROXIMATION AND KERNELIZATION
    Fomin, Fedor V.
    Lokshtanov, Daniel
    Misra, Neeldhara
    Philip, Geevarghese
    Saurabh, Saket
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (01) : 383 - 410
  • [18] Uniform kernelization complexity of hitting forbidden minors
    20155101705911
    (1) University of Warsaw, Warsaw, Poland; (2) Eindhoven University of Technology, Eindhoven, Netherlands; (3) University of Bergen, Bergen, Norway; (4) Institute of Mathematical Sciences, Chennai, India, 1600, ERATO Kawarabayashi Large Graph Project; MEXT Grant-in-Aid for Scientific Research on Innovative Areas: Exploring the Limits of Computation; Research Institute for Mathematical Sciences; Tateisi Science and Technology Foundation (Springer Verlag):
  • [19] Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories
    Fazekas, Katalin
    Bacchus, Fahiem
    Biere, Armin
    AUTOMATED REASONING, IJCAR 2018, 2018, 10900 : 134 - 151
  • [20] Uniform Kernelization Complexity of Hitting Forbidden Minors
    Giannopoulou, Archontia C.
    Jansen, Bart M. P.
    Lokshtanov, Daniel
    Saurabh, Saket
    ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (03)
12345