MAX-SNP hardness of MIN-PC and MASC-GP(n) problems

Authors:
M. I. Poberii
Affiliations:
Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia 620219
Venue:
Pattern Recognition and Image Analysis
Year:
2011

Citing 3
Cited 0

Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Hardness of Set Cover with Intersection 1

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that the problem on the minimal covering of a finite number of points in a plane by a set of straight lines (MIN-PC) and the problem on the minimal affine separating committee formulated in a fixed dimension space within n 1 (MASC-GP(n)) are NP-hard in the strong sense. In the present work, it is shown that these problems are MAX-SNP-hard.