Pages that link to "Item:Q5321718"
From MaRDI portal
The following pages link to Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718):
Displayed 11 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- On approximating string selection problems with outliers (Q391209) (← links)
- On the hardness of the consensus string problem (Q396596) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Parameterized complexity analysis for the closest string with wildcards problem (Q495996) (← links)
- The parameterized complexity of the shared center problem (Q517791) (← links)
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029) (← links)
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)