An O (n log n) randomizing algorithm for the weighted Euclidean 1-center problem
Year of publication: |
1984
|
---|---|
Authors: | Megiddo, Nimrod ; Zemel, Eitan |
Publisher: |
Evanston, Ill. |
Subject: | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
Computing integral solutions of complementarity problems
Laan, Gerard van der, (2004)
- More ...
-
An O (n log n) Randomizing Algorithm for the Weighted Euclidean l-Center Problem
Megiddo, Nimrod, (1984)
-
An O (n log n) Randomizing Algorithm for the Weighted Euclidean l-Center Problem
Megiddo, Nimrod, (1984)
-
Pursuing Mobile Hiders in a Graph
Megiddo, Nimrod, (1978)
- More ...