Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

NP-hardness of some max-min clustering problems

From MaRDI portal
Publication:2026156
Jump to:navigation, search

DOI10.1007/978-3-030-10934-9_11zbMath1468.90110OpenAlexW2910838307MaRDI QIDQ2026156

Artem V. Pyatkin, Vladimir Khandeev, Alexander Kel'Manov

Publication date: 18 May 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-10934-9_11

zbMATH Keywords

clusteringEuclidean spaceNP-hardnessquadratic variationmax-min problem


Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)





Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2026156&oldid=14490515"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 19:37.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki