Polynomial algorithms for center location on spheres

DOI10.1002/(SICI)1520-6750(199706)44:4%3C341::AID-NAV4%3E3.0.CO;2-6MaRDI QIDQ4367291zbMATH OpenOpenAlexFDO

Authors Mordechai Jaeger, Jeff Goldberg

Publication date 25 November 1997

Full work available at URL https://doi.org/10.1002/(sici)1520-6750(199706)44:4%3C341::aid-nav4%3E3.0.co;2-6

zbMATH Keywords

one-center problemspherical surfacetwo-center problems

Mathematics Subject Classification ID

Continuous location (90B85)

Recommendations

• Spherical minimax location problem
• scientific article; zbMATH DE number 895364
• Multifacility location problems on a sphere
• Minimax and maximin facility location problems on a sphere
• An Algorithm for the p-Center Problem in the Plane

Cited in

(8)

• A polynomial time algorithm for a hemispherical minimax location problem
• An algorithm for finding the Chebyshev center of a convex polyhedron
• Solution of an equiweighted minimax location problem on a hemisphere
• Off-centered ``walk-on-spheres (WOS) algorithm
• Locating a Circle on a Sphere
• scientific article; zbMATH DE number 895364 (Why is no real title available?)
• Algorithms for center and Tverberg points
• Spherical minimax location problem

This page was built for publication: Polynomial algorithms for center location on spheres

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