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...
Gespeichert in:
| Veröffentlicht in: | Journal of combinatorial optimization Jg. 49; H. 4; S. 61 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Springer US
01.05.2025
Springer Nature B.V |
| Schlagworte: | |
| ISSN: | 1382-6905, 1573-2886 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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 we give
O
∗
(
2
.
027
k
)
-time algorithms for
{
1
}
-M3HS and
{
1
,
3
}
-M3HS, and an
O
∗
(
1
.
381
k
)
-time algorithm for
{
2
}
-M3HS. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1382-6905 1573-2886 |
| DOI: | 10.1007/s10878-025-01300-8 |