Pages that link to "Item:Q1318686"
From MaRDI portal
The following pages link to More on the complexity of common superstring and supersequence problems (Q1318686):
Displaying 22 items.
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- Two-Dimensional partitioning problems (Q671423) (← links)
- Consistent subsequences and supersequences (Q671514) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- The consensus string problem for a metric is NP-complete (Q876700) (← 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)
- 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)
- Maximal common subsequences and minimal common supersequences (Q1917072) (← links)
- The multi-spreader crane scheduling problem: partitions and supersequences (Q2217473) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- Minimum cost multi-product flow lines (Q2480199) (← links)
- Hybridizations of Metaheuristics With Branch & Bound Derivates (Q2950520) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- Exact algorithms for the master ring problem (Q3528154) (← links)
- Approximate periods of strings (Q5958136) (← links)
- A Survey on the Complexity of Flood-Filling Games (Q6163636) (← links)
