Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
Petar Jevtić; J. Michael Steele
| Year of publication: |
2015
|
|---|---|
| Authors: | Jevtić, Petar ; Steele, John Michael |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 4, p. 992-1004
|
| Subject: | Euclidean networks | subadditive Euclidean functional | caterpillar graphs | shortest paths | traveling salesman problem | Beardwood | Halton and Hammersley theorem | minimal spanning trees | Gutman graphs | Graphentheorie | Graph theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011409032