Pages that link to "Item:Q1424248"
From MaRDI portal
The following pages link to Fixed-parameter algorithms for CLOSEST STRING and related problems (Q1424248):
Displayed 46 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← 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)
- Separating sets of strings by finding matching patterns is almost always hard (Q507598) (← links)
- The parameterized complexity of the shared center problem (Q517791) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Improved optimization modelling for the closest string and related problems (Q651767) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- On the string consensus problem and the Manhattan sequence consensus problem (Q1698720) (← links)
- On the kernelization complexity of string problems (Q1749539) (← links)
- A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- On the computational complexity of closest genome problems (Q2295622) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers (Q2317862) (← links)
- Designing and implementing algorithms for the closest string problem (Q2319901) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← 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)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- Parameterized Enumeration for Modification Problems (Q2799203) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)
- Finding Consensus Strings with Small Length Difference Between Input and Solution Strings (Q2946423) (← links)
- Designing and Implementing Algorithms for the Closest String Problem (Q4632205) (← links)
- (Q5005095) (← links)
- (Q5075765) (← links)
- (Q5111743) (← links)
- Tight Hardness Results for Consensus Problems on Circular Strings and Time Series (Q5128513) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)
- Consensus String Problem for Multiple Regular Languages (Q5738997) (← links)
- Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)