The following pages link to The minimum substring cover problem (Q958306):
Displaying 4 items.
- Some algorithmic results for [2]-sumset covers (Q458372) (← links)
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Effective heuristics for the Set Covering with Pairs Problem (Q3002555) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
