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 条
  • [41] On the kernelization complexity of string problems
    Basavaraju, Manu
    Panolan, Fahad
    Rai, Ashutosh
    Ramanujan, M. S.
    Saurabh, Saket
    THEORETICAL COMPUTER SCIENCE, 2018, 730 : 21 - 31
  • [42] Kernelization and sparseness: The case of dominating set
    2016, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing (47):
  • [43] Kernelization for cycle transversal problems
    Xia, Ge
    Zhang, Yong
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (7-8) : 1224 - 1231
  • [44] EFFECT OF CARDINALITY AND FREQUENCY RESTRICTIONS ON THE HITTING SET AND VERTEX COVER PROBLEMS
    KOUNTANIS, D
    LIU, JQ
    WILLIAMS, K
    ARS COMBINATORIA, 1993, 35 : 15 - 24
  • [45] Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
    Gutin, G.
    Jones, M.
    Yeo, A.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (41) : 5744 - 5751
  • [46] Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving
    Larrosa, Javier
    Martinez, Conrado
    Rollon, Emma
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 8, 2024, : 8057 - 8064
  • [47] Kernelization Complexity of Solution Discovery Problems
    Grobler, Mario
    Maaz, Stephanie
    Mouawad, Amer E.
    Nishimura, Naomi
    Ramamoorthi, Vijayaragunathan
    Siebertz, Sebastian
    Leibniz International Proceedings in Informatics, LIPIcs, 322
  • [48] Feasibility of set-valued implicit complementarity problems
    Ren-you Zhong
    Xiao-guo Wang
    Jiang-hua Fan
    Journal of Inequalities and Applications, 2013
  • [49] Feasibility of set-valued implicit complementarity problems
    Zhong, Ren-you
    Wang, Xiao-guo
    Fan, Jiang-hua
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2013,
  • [50] Maximum matching and kernelization of edge dominating set
    Gao, Hang
    Gao, Wenyu
    INFORMATION PROCESSING LETTERS, 2018, 136 : 21 - 24
12345