Randomized Adaptive Test Cover

DOI10.1007/978-3-319-18173-8_13zbMath1353.68256OpenAlexW1862233584MaRDI QIDQ2947019

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

zbMATH Keywords

game theoryrandomizationcombinatorial searchfractional graph theoryLP duality

Mathematics Subject Classification ID

Hypergraphs (05C65) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Fractional graph theory, fuzzy graph theory (05C72)

Cites Work

• Parameterizations of test cover with bounded test sizes
• Rounds in combinatorial search
• Approximation algorithms for the test cover problem
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
• (Non-)existence of polynomial kernels for the test cover problem
• Parameterized Study of the Test Cover Problem
• Partially Polynomial Kernels for Set Cover and Test Cover
• A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
• A Parameterized Perspective on Packing Paths of Length Two
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Randomized Adaptive Test Cover