On a variant of the problem of choosing a vector subset

MaRDI QIDQ3115704zbMATH OpenFDO

Authors A. V. Kel'manov, Artem Pyatkin

Publication date 10 February 2012

zbMATH Keywords

cluster analysisNP-completenessalgorithmic complexitychoice of a vector subset

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• On the complexity of certain problems of choosing subset of vectors
• NP-completeness of some problems of a vectors subset choice
• On complexity of the problem of choosing a vector subset with maximal sum length
• The problem of finding a subset of vectors with maximal total weight
• An approximation algorithm for solving the problem of the search of a subset of vectors

Cited in

(9)

• On the complexity of certain problems of choosing subset of vectors
• scientific article; zbMATH DE number 6004969 (Why is no real title available?)
• NP-completeness of some problems of a vectors subset choice
• On complexity of the problem of choosing a vector subset with maximal sum length
• On selecting a maximum volume sub-matrix of a matrix and related problems
• scientific article; zbMATH DE number 6004955 (Why is no real title available?)
• Solving some vector subset problems by Voronoi diagrams
• The problem of finding a subset of vectors with maximal total weight
• On the General Position Subset Selection Problem

This page was built for publication: On a variant of the problem of choosing a vector subset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115704)