Skip to main navigation
Skip to search
Skip to main content
University of Luebeck Home
English
Deutsch
Home
Research Units
Experts
Publications
Projects
Datasets
Prizes
Spin-Offs
Activities
Media
Search by expertise, name or affiliation
Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time.
Max Bannach, Malte Skambath,
Till Tantau
Institute of Theoretical Computer Science
University of Kiel
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Kernelizing the Hitting Set Problem in Linear Sequential and Constant Parallel Time.'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Edge
50%
Hitting Set
100%
Hypergraphs
16%
Linear Time
16%
Polynomial
33%
Set Size
16%
Computer Science
Approximation (Algorithm)
100%