Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence

Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence Full article

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2018, Pages: 326-336 Pages count : 11 DOI: 10.1007/978-3-030-05348-2_28

Tags

Euclidean space; Exact algorithm; Fixed space dimension; Integer coordinates; Largest set; Longest subsequence; NP-hard problem; Pseudopolynomial time; Quadratic variation

Authors

Kel’manov Alexander ^1,2 , Khamidullin Sergey ¹ , Khandeev Vladimir ^1,2 , Pyatkin Artem ^1,2

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Kel’manov A. , Khamidullin S. , Khandeev V. , Pyatkin A.
Exact Algorithms for Two Quadratic Euclidean Problems of Searching for the Largest Subset and Longest Subsequence
Lecture Notes in Computer Science. 2018. P.326-336. DOI: 10.1007/978-3-030-05348-2_28 Scopus OpenAlex

Scopus:	2-s2.0-85059932946
OpenAlex:	W2906709995

DB	Citing
Scopus	2
OpenAlex	3