Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center

DOI10.1134/S1064562413030253zbMATH Open1275.90129OpenAlexW1970680540MaRDI QIDQ378186FDOQ378186

Authors: V. V. Shenmaier 

Publication date: 11 November 2013

Published in: Doklady Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• `` Strong NP-Completeness Results
• Iterated nearest neighbors and finding minimal polytopes
• Finding k points with minimum diameter and related problems
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• NP-completeness of some problems of a vectors subset choice
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions

This page was built for publication: Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center

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