Pages that link to "Item:Q963389"
From MaRDI portal
The following pages link to An improved lower bound on approximation algorithms for the closest substring problem (Q963389):
Displaying 5 items.
- A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
- Lower Bounds for Approximation Schemes for Closest String (Q5369514) (← links)
- Combinatorial Pattern Matching (Q5713531) (← links)
- Fundamentals of Computation Theory (Q5900797) (← links)
- Fundamentals of Computation Theory (Q5900798) (← links)