Skip to search formSkip to main contentSkip to account menu

1-center problem

Known as: Minimax facility location, 1-center, Minmax facility location 
The 1-center problem or minimax or minmax location problem is a classical combinatorial optimization problem in operations research of facilities… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Bounding sphereClosest stringFacility location problemGeometric median

Broader (1)

Combinatorial optimization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Clustering in Hilbert simplex geometry
Clustering categorical distributions in the probability simplex is a fundamental task met in many applications dealing with… 
2016
2016
Linear Time Algorithm for 1-Center in Rd Under Convex Polyhedral Distance Function
In this paper we present algorithms for computing 1-center of a set of points for convex polyhedral distance function in… 
Highly Cited
2012
Highly Cited
2012
Lexicographic α-robustness: An alternative to min-max criteria
2010
2010
Inverse center location problems
2006
2006
Geometric facility location under continuous motion: bounded-velocity approximations to the mobile euclidean k-centre and k-median problems
The traditional problems of facility location are defined statically; a set (or multiset) of n points is given as input… 
2006
2006
A Simple Streaming Algorithm for Minimum Enclosing Balls
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of… 
2003
2003
Locating a 1-Center on a Manhattan Plane with “Arbitrarily” Shaped Barriers
Barriers commonly occur in practical location and layout problems and are regions where neither travel through nor location of… 
2002
2002
A Note on the Robust 1-Center Problem on Trees
We consider the robust 1-center problem on trees with uncertainty in vertex weights and edge lengths. The weights of the vertices… 
Highly Cited
1995
Highly Cited
1995
On the Minimum Diameter Spanning Tree Problem
Highly Cited
1983
Highly Cited
1983
The Weighted Euclidean 1-Center Problem
We present an O(n(log n)3(log log n)2) algorithm for the problem of finding a point (x, y) in the plane that minimizes the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)