Pages that link to "Item:Q2485280"
From MaRDI portal
The following pages link to Tight approximability results for test set problems in bioinformatics (Q2485280):
Displaying 14 items.
- Approximation complexity of metric dimension problem (Q450564) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- A novel approach for detecting multiple rumor sources in networks with partial observations (Q512871) (← links)
- Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
- Parameterized lower bound and inapproximability of polylogarithmic string barcoding (Q941834) (← links)
- Non-unique probe selection and group testing (Q995556) (← links)
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144) (← links)
- On approximation algorithm for the edge metric dimension problem (Q2220845) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Low-dimensional representation of genomic sequences (Q2311893) (← links)
- Approximating the online set multicover problems via randomized winnowing (Q2481951) (← links)
- On Approximation Complexity of Metric Dimension Problem (Q3000502) (← links)
- Faster Algorithm for the Set Variant of the String Barcoding Problem (Q3506944) (← links)
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications (Q6071823) (← links)
