Approximations for the random minimal spanning tree with application to network provisioning
Year of publication: |
1988
|
---|---|
Authors: | Jain, Anjani ; Mamer, John W. |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 36.1988, 4, p. 575-584
|
Subject: | Netzwerkanalyse | Mathematik | Graphentheorie | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
On the complexity of Convex Hull Algorithms if rotational minima can be found very fast
Huckenbeck, Ulrich, (1988)
-
Ruhe, G., (1988)
-
Survey of solved and open problems in the degeneracy phenomenon
Gal, Tomas, (1987)
- More ...
-
Routing heuristics for automated pick and place machines
Ahmadi, Reza H., (1999)
-
Mamer, John W., (2000)
-
Comparative statics in non-cooperative games via transfinitely iterated play
Lippman, Steven A., (1987)
- More ...