2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence › Research Explorer

Novosibirsk State University's Research Portal

2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence

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

DOI

https://doi.org/10.1007/978-3-030-40616-5_34
Final published version

Alexander Kel’manov
Sergey Khamidullin
Anna Panasenko

Original language	English
Title of host publication	Numerical Computations
Subtitle of host publication	Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers
Editors	Yaroslav D. Sergeyev, Dmitri E. Kvasov
Publisher	Springer Gabler
Pages	386-393
Number of pages	8
ISBN (Print)	9783030406158
DOIs	https://doi.org/10.1007/978-3-030-40616-5_34
Publication status	Published - 1 Jan 2020
Event	3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019 - Crotone, Italy Duration: 15 Jun 2019 → 21 Jun 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11974 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	3rd Triennial International Conference and Summer School on Numerical Computations: Theory and Algorithms, NUMTA 2019
Country/Territory	Italy
City	Crotone
Period	15.06.2019 → 21.06.2019

Research areas

Approximation algorithm, Euclidean space, NP-hard problem, Polynomial time, Quadratic variation, Sequence of points, Weighted 2-partition, SERIES DATA

OECD FOS+WOS

1.02 COMPUTER AND INFORMATION SCIENCES
1.01 MATHEMATICS

ID: 23740780