Pages that link to "Item:Q5199158"
From MaRDI portal
The following pages link to Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem (Q5199158):
Displaying 7 items.
- Minimum common string partition revisited (Q437061) (← links)
- The complexity of string partitioning (Q2343298) (← links)
- Mathematical programming strategies for solving the minimum common string partition problem (Q2630223) (← links)
- The Complexity of String Partitioning (Q2904489) (← links)
- Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable (Q5383967) (← links)
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem (Q5963700) (← links)
- Minimum common string partition: on solving large‐scale problem instances (Q6088232) (← links)