Faster parameterized algorithms for variants of 3-Hitting Set

In the A -Multi 3 -Hitting Set problem ( A -M3HS), where 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 ∩ e | ∈ A for every hyperedge e . In this paper w...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of combinatorial optimization Ročník 49; číslo 4; s. 61
Hlavný autor:	Tsur, Dekel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2025 Springer Nature B.V
Predmet:	Algorithms Apexes Combinatorics Convex and Discrete Geometry Graphs Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Parameterized complexity Branching algorithms Graph algorithms
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!