Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset

Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset Full article

Journal

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

Output data

Year: 2018, Pages: 294-304 Pages count : 11 DOI: 10.1007/978-3-030-11027-7_28

Authors

Kel’manov Alexander ^1,2 , Khandeev Vladimir ^1,2 , Panasenko Anna ^1,2

Affiliations

1	Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
2	Novosibirsk State University, 2 Pirogova St., 630090 Novosibirsk, Russia

Kel’manov A. , Khandeev V. , Panasenko A.
Exact Algorithms for the Special Cases of Two Hard to Solve Problems of Searching for the Largest Subset
Lecture Notes in Computer Science. 2018. P.294-304. DOI: 10.1007/978-3-030-11027-7_28 Scopus OpenAlex

Scopus:	2-s2.0-85059959288
OpenAlex:	W2907869754

DB	Citing
OpenAlex	3
Scopus	2