Pages that link to "Item:Q2838802"
From MaRDI portal
The following pages link to Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence (Q2838802):
Displaying 3 items.
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence (Q2294598) (← links)
- A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← links)
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)