Approximation algorithms for the longest run subsequence problem (Q6622004)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7929265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for the longest run subsequence problem |
scientific article; zbMATH DE number 7929265 |
Statements
Approximation algorithms for the longest run subsequence problem (English)
0 references
21 October 2024
0 references
longest run subsequence problem
0 references
bounded occurrence
0 references
approximation algorithm
0 references
