Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center
type: Item
instance of: scholarly article
title: Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center
zbMATH Open document ID: 1275.90129
DOI: 10.1134/S1064562413030253
author: V. V. Shenmaier
published in: Doklady Mathematics
publication date: 2013-11-11T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6225248
MaRDI profile type: Publication
cites work: Finding k points with minimum diameter and related problems
cites work: Q4471374
cites work: Iterated nearest neighbors and finding minimal polytopes
cites work: `` Strong '' NP-Completeness Results
cites work: Q3843864
cites work: Q5513397
cites work: Fast algorithms for computing the smallest \(k\)-enclosing circle
cites work: Q3115233
cites work: Q4298260
cites work: Q4782696
cites work: Q4154035
full work available at URL: s1064562413030253
OpenAlex ID: W1970680540
description: scientific article; zbMATH DE number 6225248