Complexity and algorithms for finding a subset of vectors with the longest sum

DOI10.1007/978-3-319-62389-4_39zbMath1433.68503OpenAlexW2731027975MaRDI QIDQ5920162

Vladimir Shenmaier

Publication date: 23 October 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_39

zbMATH Keywords

normed spaceoptimal solutioncomputational geometryAPX-hardnessvector sum

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Complexity and approximation of finding the longest vector sum ⋮ Approximability of the Problem of Finding a Vector Subset with the Longest Sum

This page was built for publication: Complexity and algorithms for finding a subset of vectors with the longest sum