A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum

DOI10.1134/S1990478915030060zbMath1349.90881OpenAlexW2203216890MaRDI QIDQ3186828

I. A. Rykov, E. Kh. Gimadi

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmasymptotical exactnesssearch for vector subset

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Randomized algorithms (68W20)

Uses Software

• ISLR
• PRMLT

Cites Work

• A randomized algorithm for two-cluster partition of a set of vectors
• Machine Learning
• An Introduction to Statistical Learning
• Cluster Analysis and Mathematical Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum