Pages that link to "Item:Q545371"
From MaRDI portal
The following pages link to New complexity results for the \(k\)-covers problem (Q545371):
Displaying 10 items.
- Enhanced string covering (Q393116) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- A new approximation algorithm for \(k\)-set cover problem (Q1639350) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- String Covering: A Survey (Q6145625) (← links)