Pseudo-polynomial Algorithms for Some Problems of Searching for the Largest Subsets › Research Explorer

Novosibirsk State University's Research Portal

Pseudo-polynomial Algorithms for Some Problems of Searching for the Largest Subsets

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

DOI

https://doi.org/10.1007/978-3-031-73365-9_22
Final published version

Vladimir Khandeev
Sergey Neshchadim

Original language	English
Title of host publication	Communications in Computer and Information Science
Publisher	Springer
Pages	319-333
Number of pages	15
ISBN (Electronic)	978-3-031-73365-9
ISBN (Print)	978-303173364-2
DOIs	https://doi.org/10.1007/978-3-031-73365-9_22
Publication status	Published - 20 Dec 2024
Event	23rd International Conference on Mathematical Optimization Theory and Operations Research - Омск, Russian Federation Duration: 30 Jun 2024 → 6 Jul 2024 Conference number: 23

Publication series

Name	Communications in Computer and Information Science
Volume	2239 CCIS

Conference

Conference	23rd International Conference on Mathematical Optimization Theory and Operations Research
Abbreviated title	MOTOR 2024
Country/Territory	Russian Federation
City	Омск
Period	30.06.2024 → 06.07.2024

Research areas

Bounded scatter, Clustering, Euclidean space, Max-min problem, NP-hardness, Pseudo-polynomial algorithm

OECD FOS+WOS

1.02.ER COMPUTER SCIENCE, CYBERNETICS

ID: 61412560