On the complexity and approximability of some Euclidean optimal summing problems

DOI10.1134/S0965542516100080zbMath1400.68248OpenAlexW2533199277MaRDI QIDQ506239

Artem V. Pyatkin, Anton Valentinovich Eremeev, Alexander Kel'Manov

Publication date: 31 January 2017

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542516100080

zbMATH Keywords

Euclidean spacecluster analysisNP-hardnessdiscrete optimization problemsnorm of sumpseudopolynomial solvabilitysearch for a subset

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• On the complexity of a search for a subset of ``similar vectors
• Trading Hubs Construction for Electricity Markets
• On complexity of some problems of cluster analysis of vector sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity and approximability of some Euclidean optimal summing problems