Maximum Solow--Polasky Diversity Subset Selection Is NP-hard Even in the Euclidean Plane

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Emmerich, Michael T. M., Pereverdieva, Ksenia, Deutz, André H.
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry Computational Complexity Optimization and Control 68Q17, 90C27, 05C69 F.2.2; F.1.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2604.19484