Complexity and approximation of the longest vector sum problem

DOI10.1007/978-3-319-89441-6_4zbMath1504.68267OpenAlexW2794817095MaRDI QIDQ1644921

Vladimir Shenmaier

Publication date: 22 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-89441-6_4

zbMATH Keywords

normed spaceapproximation algorithmcomputational geometryW[2-hardness]inapproximability boundvector 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) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Approximability of the Problem of Finding a Vector Subset with the Longest Sum

This page was built for publication: Complexity and approximation of the longest vector sum problem