Pages that link to "Item:Q1424310"
From MaRDI portal
The following pages link to Approximation algorithms for the test cover problem (Q1424310):
Displaying 48 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Sensor placement for fault location identification in water networks: a minimum test cover approach (Q311945) (← links)
- Deterministic versus randomized adaptive test cover (Q329717) (← links)
- Integrated model for software component selection with simultaneous consideration of implementation and verification (Q339707) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Non-unique probe selection and group testing (Q995556) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- An adaptive heuristic algorithm for VLSI test vectors selection (Q1042192) (← links)
- Mathematical programming in computational biology: an annotated bibliography (Q1662439) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- Separating codes and traffic monitoring (Q1704860) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- (Non-)existence of polynomial kernels for the test cover problem (Q1943629) (← links)
- The generalized test collection problem (Q1979174) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
- Combinatorial search in two and more rounds (Q2420609) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- Tight approximability results for test set problems in bioinformatics (Q2485280) (← links)
- Local improvement algorithms for a path packing problem: a performance analysis based on linear programming (Q2661591) (← links)
- The stochastic test collection problem: models, exact and heuristic solution approaches (Q2670528) (← links)
- Test sets for vertex cover problems (Q2741341) (← links)
- Separating Codes and Traffic Monitoring (Q2830061) (← links)
- Parameterized Study of the Test Cover Problem (Q2912727) (← links)
- Randomized Adaptive Test Cover (Q2947019) (← links)
- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set (Q3611893) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Algorithm Theory - SWAT 2004 (Q5315401) (← links)
- A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)
- Experimental and Efficient Algorithms (Q5710009) (← links)
- Discriminating Codes in Geometric Setups (Q6065423) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
- On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes (Q6575414) (← links)
