The Weighted Euclidean 1-Center Problem

@article{Megiddo1983TheWE,
  title={The Weighted Euclidean 1-Center Problem},
  author={Nimrod Megiddo},
  journal={Math. Oper. Res.},
  year={1983},
  volume={8},
  pages={498-504}
}
The special case where wi = 1, i = 1, . . . , n, was proposed by J. Sylvester in 1857 and amounts to finding the smallest circle that contains all the given points. The general case was introduced by Francis [3]. The most efficient algorithm known to date for the unweighted case is an O(n logn) algorithm by Shamos and Hoey [lo].' This algorithm utilizes the data structure so-called "Farthest point Voronoi diagram." It is not clear whether the generalization of this concept into weighted Voronoi… CONTINUE READING
45 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

New Parallel-Sorting Schemes

  • P.F.
  • IEEE Trans. Comput. C-27 669-673.
  • 1978

Optimal Location of a Single Service Center of Certain Types

  • K.P.K. Nair, R. Chandrasekaran
  • 1971

Some Aspects of a Minimax Location Problem

  • R L.
  • Transportation Sci
  • 1967
1 Excerpt

The Enjoyment of Mathematics

  • Toeplitz
  • 1957

What Is Mathematics?, Oxford University Press, New York

  • R. Courant, H. Robbins
  • Elzinga, J. and Hearn, D. W. (1972). Geometrical…
  • 1941

Similar Papers

Loading similar papers…