Analysis of heuristics for finding a maximum weight planar subgraph
Year of publication: |
1985
|
---|---|
Authors: | Dyer, M. E. ; Foulds, L. R. ; Frieze, A. M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 20.1985, 1, p. 102-114
|
Subject: | Heuristik | Mathematik | Graphentheorie | Wahrscheinlichkeit | Standort |
-
Späth, H., (1985)
-
Facilities layout generalized model solved by n-boundary shortest path heuristics
Giffin, J. W., (1987)
-
Heuristics with constant error guarantees for the design of tree networks
Altinkemer, Kemal, (1988)
- More ...
-
Analysis of heuristics for finding a maximum weight planar subgraph
Dyer, M. E., (1985)
-
An improved vertex enumeration algorithm
Dyer, M. E., (1982)
-
An improved vertex enumeration algorithm
Dyer, M. E., (1982)
- More ...