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

DOI10.1134/S1064562413030253zbMath1275.90129OpenAlexW1970680540MaRDI QIDQ378186

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) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (1)

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

Cites Work

• Iterated nearest neighbors and finding minimal polytopes
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• Finding k points with minimum diameter and related problems
• `` Strong NP-Completeness Results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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