The absolute centre of a graph (Q793644): Difference between revisions

The problem of finding the absolute centre of a graph, which arises for example, in the selection of a site for an emergency-service centre, involves the global minimisation of certain piecewise-linear non-convex continuous functions. Using an algebraic characterization of the local minima of these functions, the author converts the continuous optimization problem into a combinatorial problem. An 0(n log n) algorithm is presented for solving this combinatorial problem.