Some easy and some not so easy geometric optimization problems

DOI10.1007/978-3-030-04693-4_1OpenAlexW2902585948MaRDI QIDQ1757753

Gerhard J. Woeginger

Publication date: 15 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04693-4_1

zbMATH Keywords

geometrycomputational complexitycombinatorial optimizationapproximation

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Selecting a subset of diverse points based on the squared Euclidean distance

This page was built for publication: Some easy and some not so easy geometric optimization problems