An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities

From MaRDI portal
Publication:3133210

DOI10.1007/978-3-319-44914-2_14zbMATH Open1380.68400OpenAlexW2557272919MaRDI QIDQ3133210FDOQ3133210


Authors: L. V. Mikhailova, A. V. Kel'manov, S. A. Khamidullin, Vladimir Khandeev Edit this on Wikidata


Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_14




Recommendations





Cited In (6)





This page was built for publication: An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133210)