hs-ll-poster.pdf (1.78 MB)
Optimal-size problem kernels for d-Hitting Set in linear time and space
Version 2 2020-08-15, 09:40
Version 1 2020-08-10, 07:16
poster
posted on 2020-08-15, 09:40 authored by René van BevernRené van Bevern, Pavel V. SmirnovPoster accompanying journal article.
Funding
Russian Foundation for Basic Research, grant 18-501-12031 NNIO_a
Mathematical Center in Akademgorodok, under agreement 075-15-2019-1675 with the Ministry of Science and Higher Education of the Russian Federation
History
Usage metrics
Categories
- Biological mathematics
- Combinatorics and discrete mathematics (excl. physical combinatorics)
- Mathematical logic, set theory, lattices and universal algebra
- Operations research
- Computational complexity and computability
- Applied mathematics not elsewhere classified
- Concurrent/parallel systems and technologies
- Data structures and algorithms
- Health informatics and information systems
- Pattern recognition
- Data mining and knowledge discovery
- Theory of computation not elsewhere classified
Keywords
combinatorial optimizationcombinatorial feature selectionNP-hard problemdata reductionparameterized complexitykernelizationdata clusteringoperations researchstation coverBiological MathematicsCombinatorics and Discrete Mathematics (excl. Physical Combinatorics)Mathematical Logic, Set Theory, Lattices and Universal AlgebraOperations ResearchAnalysis of Algorithms and ComplexityApplied Discrete MathematicsConcurrent ProgrammingData StructuresHealth InformaticsPattern Recognition and Data MiningTheoretical Computer Science
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC