Pages that link to "Item:Q2912727"
From MaRDI portal
The following pages link to Parameterized Study of the Test Cover Problem (Q2912727):
Displaying 15 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Deterministic versus randomized adaptive test cover (Q329717) (← links)
- Approximation algorithms for the test cover problem (Q1424310) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Induced-bisecting families of bicolorings for hypergraphs (Q1744760) (← links)
- (Non-)existence of polynomial kernels for the test cover problem (Q1943629) (← links)
- The generalized test collection problem (Q1979174) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← links)
- Test sets for vertex cover problems (Q2741341) (← links)
- Randomized Adaptive Test Cover (Q2947019) (← links)
- Experimental and Efficient Algorithms (Q5710009) (← links)
- Partially Polynomial Kernels for Set Cover and Test Cover (Q5741085) (← links)