- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Dynamic Kernels for Hitting Sets and Set Packing ; day:22 ; month:6 ; year:2022 ; pages:1-30
Algorithmica ; (22.6.2022), 1-30
- Creator
-
Bannach, Max
Heinrich, Zacharias
Reischuk, Rüdiger
Tantau, Till
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-00986-0
- URN
-
urn:nbn:de:101:1-2022081419370650155402
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:26 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bannach, Max
- Heinrich, Zacharias
- Reischuk, Rüdiger
- Tantau, Till
- SpringerLink (Online service)
Other Objects (12)
EV hitting sets in road networks
Optimal drug combinations and minimal hitting sets
Derandomizing Arthur–Merlin Games using Hitting Sets
FPT algorithms for diverse collections of hitting sets
Aspects of set packing, partitioning, and covering
Compression with wildcards: All exact or all minimal hitting sets
Dynamic stable set
Improved Approximation Algorithms for Weighted k-Set Packing
On the Parameterized Complexity of Compact Set Packing
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability
Ungleichungen mit Struktur: Das Rucksack und Set Packing Polytope
EV hitting sets in road networks
Optimal drug combinations and minimal hitting sets
Derandomizing Arthur–Merlin Games using Hitting Sets
FPT algorithms for diverse collections of hitting sets
Aspects of set packing, partitioning, and covering
Compression with wildcards: All exact or all minimal hitting sets
Dynamic stable set
Improved Approximation Algorithms for Weighted k-Set Packing
On the Parameterized Complexity of Compact Set Packing
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability
Ungleichungen mit Struktur: Das Rucksack und Set Packing Polytope
EV hitting sets in road networks
Optimal drug combinations and minimal hitting sets
Derandomizing Arthur–Merlin Games using Hitting Sets
FPT algorithms for diverse collections of hitting sets
Aspects of set packing, partitioning, and covering
Compression with wildcards: All exact or all minimal hitting sets
Dynamic stable set
Improved Approximation Algorithms for Weighted k-Set Packing
On the Parameterized Complexity of Compact Set Packing
On Sparse Hitting Sets : From Fair Vertex Cover to Highway Dimension
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability