Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10472-019-09623-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2924034761 / rank | |||
Normal rank | |||
Revision as of 01:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence |
scientific article |
Statements
Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (English)
0 references
11 February 2020
0 references
Euclidean space
0 references
largest subset
0 references
longest subsequence
0 references
quadratic variation
0 references
exact algorithm
0 references
pseudopolynomial time
0 references
