The following pages link to (Q4858904):
Displaying 14 items.
- The constrained shortest common supersequence problem (Q396654) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Shortest common superstrings and scheduling with coordinated starting times (Q1127327) (← links)
- On the inadequacy of tournament algorithms for the \(N\)-SCS problem (Q1178218) (← links)
- The shortest common nonsubsequence problem is NP-complete (Q1208726) (← links)
- Improved heuristics and a genetic algorithm for finding short supersequences (Q1384223) (← links)
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. (Q1401210) (← links)
- Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
- The multi-spreader crane scheduling problem: partitions and supersequences (Q2217473) (← links)
- Local search for string problems: brute-force is essentially optimal (Q2437744) (← links)
- Minimum cost multi-product flow lines (Q2480199) (← links)
- Exact algorithms for the master ring problem (Q3528154) (← links)
- Compact Flow Diagrams for State Sequences (Q4577949) (← links)
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences (Q4857599) (← links)
