Complexity and Approximability of Hyperplane Covering Problems

Michael Khachay

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Complexity and Approximability of Hyperplane Covering Problems

In Proceedings of the 4th International Workshop on Image Mining. Theory and Applications - Volume 0VISIGRAPP, 109-113, 2013 , Barcelona, Spain

Author: Michael Khachay

Affiliation: Krasovsky Institute of Mathematics and Mechanics, UB RAS, Ural Federal University and Omsk State Technical University, Russian Federation

Keyword(s): Geometric Covering Problems, Computational Complexity

Abstract: The well known N.Megiddo complexity result for Point Cover Problem on the plane is extended onto $d$-dimensional space (for any fixed $d$). It is proved that Min-$d$PC problem is $L$-reducible to Min-$(d+1)$PC problem, therefore for any fixed $d>1$ there is no PTAS for Min-$d$PC problem, unless $P=NP.$

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 18.222.22.244

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Khachay, M. (2013). Complexity and Approximability of Hyperplane Covering Problems. In Proceedings of the 4th International Workshop on Image Mining. Theory and Applications (VISIGRAPP 2013) - IMTA-4; ISBN 978-989-8565-50-1, SciTePress, pages 109-113. DOI: 10.5220/0004394601090113

@conference{imta-413,
author={Michael Khachay.},
title={Complexity and Approximability of Hyperplane Covering Problems},
booktitle={Proceedings of the 4th International Workshop on Image Mining. Theory and Applications (VISIGRAPP 2013) - IMTA-4},
year={2013},
pages={109-113},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004394601090113},
isbn={978-989-8565-50-1},
}

TY - CONF

JO - Proceedings of the 4th International Workshop on Image Mining. Theory and Applications (VISIGRAPP 2013) - IMTA-4
TI - Complexity and Approximability of Hyperplane Covering Problems
SN - 978-989-8565-50-1
AU - Khachay, M.
PY - 2013
SP - 109
EP - 113
DO - 10.5220/0004394601090113
PB - SciTePress