Pages that link to "Item:Q5369514"
From MaRDI portal
The following pages link to Lower Bounds for Approximation Schemes for Closest String (Q5369514):
Displaying 10 items.
- An improved lower bound on approximation algorithms for the closest substring problem (Q963389) (← links)
- A new distance metric on strings computable in linear time (Q1102764) (← links)
- Best approximations of fitness functions of binary strings (Q1768787) (← links)
- Polynomial time approximation schemes for all 1-center problems on metric rational set similarities (Q2663710) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- (Q5075765) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- Randomized and Parameterized Algorithms for the Closest String Problem (Q5165596) (← links)
- Parameterized Complexity Analysis for the Closest String with Wildcards Problem (Q5165600) (← links)
- Low-Rank Binary Matrix Approximation in Column-Sum Norm. (Q6062156) (← links)