Faster parameterized algorithms for variants of 3-Hitting Set

Dekel Tsur ()
Additional contact information
Dekel Tsur: Ben-Gurion University of the Negev

Journal of Combinatorial Optimization, 2025, vol. 49, issue 4, No 8, 14 pages

Abstract: Abstract In the A-Multi3-Hitting Set problem (A-M3HS), where $$A \subseteq \{1,2,3\}$$ A ⊆ { 1 , 2 , 3 } , the input is a hypergraph G in which the hyperedges have sizes at most 3 and an integer k, and the goal is to decide if there is a set S of at most k vertices such that $$|S \cap e| \in A$$ | S ∩ e | ∈ A for every hyperedge e. In this paper we give $$O^*(2.027^k)$$ O ∗ ( 2 . 027 k ) -time algorithms for $$\{1\}$$ { 1 } -M3HS and $$\{1,3\}$$ { 1 , 3 } -M3HS, and an $$O^*(1.381^k)$$ O ∗ ( 1 . 381 k ) -time algorithm for $$\{2\}$$ { 2 } -M3HS.

Keywords: Graph algorithms; Parameterized complexity; Branching algorithms (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01300-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:4:d:10.1007_s10878-025-01300-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01300-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().