Randomized adaptive test cover
From MaRDI portal
Publication:2947019
DOI10.1007/978-3-319-18173-8_13zbMATH Open1353.68256OpenAlexW1862233584MaRDI QIDQ2947019FDOQ2947019
Authors: Peter Damaschke
Publication date: 21 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18173-8_13
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Hypergraphs (05C65) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- Approximation algorithms for the test cover problem
- (Non-)existence of polynomial kernels for the test cover problem
- Parameterizations of test cover with bounded test sizes
- Parameterized study of the test cover problem
- Partially Polynomial Kernels for Set Cover and Test Cover
- A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques
- Title not available (Why is that?)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
- Rounds in combinatorial search
- A Parameterized Perspective on Packing Paths of Length Two
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Randomized adaptive test cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947019)