An Exact Algorithm of Searching for the Largest Size Cluster in an Integer Sequence 2-Clustering Problem

An Exact Algorithm of Searching for the Largest Size Cluster in an Integer Sequence 2-Clustering Problem Full article

Journal

Communications in Computer and Information Science
ISSN: 1865-0929

Output data

Year: 2019, Pages: 131-143 Pages count : 13 DOI: 10.1007/978-3-030-10934-9_10

Tags

2-partition; Euclidean space; Exact algorithm; Fixed space dimension; Integer coordinates; Longest subsequence; NP-hard problem; Pseudopolynomial running time; Quadratic variance; Sequence

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.
An Exact Algorithm of Searching for the Largest Size Cluster in an Integer Sequence 2-Clustering Problem
Communications in Computer and Information Science. 2019. P.131-143. DOI: 10.1007/978-3-030-10934-9_10 Scopus OpenAlex

Scopus:	2-s2.0-85061210935
OpenAlex:	W2910611243

Пока нет цитирований