- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2878
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Approximate Euclidean Steiner Trees ; day:22 ; month:11 ; year:2016 ; pages:1-29
Journal of optimization theory and applications ; (22.11.2016), 1-29
- Urheber
-
Ras, Charl
- Beteiligte Personen und Organisationen
-
Swanepoel, Konrad
Thomas, Doreen Anne
SpringerLink (Online service)
- DOI
-
10.1007/s10957-016-1036-5
- URN
-
urn:nbn:de:1111-201612134223
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:03 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Ras, Charl
- Swanepoel, Konrad
- Thomas, Doreen Anne
- SpringerLink (Online service)
Ähnliche Objekte (12)
Computing Euclidean Steiner trees over segments
Computing Euclidean Steiner trees over segments
A Physarum-inspired approach to the Euclidean Steiner tree problem
Connecting Euclidean Networks---The Steiner Case
Baldwin effect and Lamarckian evolution in a memetic algorithm for Euclidean Steiner tree problem
Approximate tree embedding for querying XML data
Hierarchical bloom filter trees for approximate matching
Approximate image-based tree-modeling using particle flows
Euclidean sequences
Euclidean supergravity
Minimal Euclidean Networks with Flow Dependent Costs--The Generalized Steiner Case
Approximate minimum tree cover in all symmetric monotone norms simultaneously
Computing Euclidean Steiner trees over segments
Computing Euclidean Steiner trees over segments
A Physarum-inspired approach to the Euclidean Steiner tree problem
Connecting Euclidean Networks---The Steiner Case
Baldwin effect and Lamarckian evolution in a memetic algorithm for Euclidean Steiner tree problem
Approximate tree embedding for querying XML data
Hierarchical bloom filter trees for approximate matching
Approximate image-based tree-modeling using particle flows
Euclidean sequences
Euclidean supergravity
Minimal Euclidean Networks with Flow Dependent Costs--The Generalized Steiner Case
Approximate minimum tree cover in all symmetric monotone norms simultaneously
Computing Euclidean Steiner trees over segments
Computing Euclidean Steiner trees over segments
A Physarum-inspired approach to the Euclidean Steiner tree problem
Connecting Euclidean Networks---The Steiner Case
Baldwin effect and Lamarckian evolution in a memetic algorithm for Euclidean Steiner tree problem
Approximate tree embedding for querying XML data
Hierarchical bloom filter trees for approximate matching
Approximate image-based tree-modeling using particle flows
Euclidean sequences
Euclidean supergravity
Minimal Euclidean Networks with Flow Dependent Costs--The Generalized Steiner Case