Dynamic Kernels for Hitting Sets and Set Packing

Computing small kernels for the hitting set problem is a well-studied computational problem where we are given a hypergraph with n vertices and m hyperedges, each of size d for some small constant d , and a parameter k . The task is to compute a new hypergraph, called a kernel , whose size is p...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 84; no. 11; pp. 3459 - 3488
Main Authors:	Bannach, Max, Heinrich, Zacharias, Reischuk, Rüdiger, Tantau, Till
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2022 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Inserts Kernels Mathematics of Computing Parameters Polynomials Special Issue on Parameterized and Exact Computation (IPEC 2021) Theory of Computation Hitting Set Dynamic Algorithms Kernelization Set Packings
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!