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 条
  • [31] Smaller kernels for hitting set problems of constant arity
    Nishimura, N
    Ragde, P
    Thilikos, DM
    PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2004, 3162 : 121 - 126
  • [32] Kernelization of Counting Problems
    Lokshtanov, Daniel
    Misra, Pranabendu
    Saurabh, Saket
    Zehavi, Meirav
    15TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE, ITCS 2024, 2024,
  • [33] A clonal selection algorithm for coloring, hitting set and satisfiability problems
    Cutello, Vincenzo
    Nicosia, Giuseppe
    NEURAL NETS, 2006, 3931 : 324 - 337
  • [34] Linear kernelizations for restricted 3-Hitting Set problems
    Xuan Cai
    INFORMATION PROCESSING LETTERS, 2009, 109 (13) : 730 - 738
  • [35] Fixed-parameter algorithms for Fair Hitting Set problems
    Inamdar, Tanmay
    Kanesh, Lawqueen
    Kundu, Madhumita
    Purohit, Nidhi
    Saurabh, Saket
    INFORMATION AND COMPUTATION, 2025, 302
  • [36] PTAS for Geometric Hitting Set Problems via Local Search
    Mustafa, Nabil H.
    Ray, Saurabh
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 17 - 22
  • [37] Kernelization and Sparseness: the Case of Dominating Set
    Drange, Pal Gronas
    Dregi, Markus
    Fomin, Fedor V.
    Kreutzer, Stephan
    Lokshtanov, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Reidl, Felix
    Villaamil, Fernando Sanchez
    Saurabh, Saket
    Siebertz, Sebastian
    Sikdar, Somnath
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
  • [38] Kernelization for Cycle Transversal Problems
    Xia, Ge
    Zhang, Yong
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 293 - +
  • [39] On the kernelization of split graph problems
    Yang, Yongjie
    Shrestha, Yash Raj
    Li, Wenjun
    Guo, Jiong
    THEORETICAL COMPUTER SCIENCE, 2018, 734 : 72 - 82
  • [40] On the Kernelization Complexity of String Problems
    Basavaraju, Manu
    Panolan, Fahad
    Rai, Ashutosh
    Ramanujan, M. S.
    Saurabh, Saket
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 141 - 153
12345