Approximate Euclidean Steiner Trees

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

ISSN: 1573-2878

Extent: Online-Ressource

Language: Englisch

Notes: online resource.

Bibliographic citation: Approximate Euclidean Steiner Trees ; day:22 ; month:11 ; year:2016 ; pages:1-29
Journal of optimization theory and applications ; (22.11.2016), 1-29

Creator: Ras, Charl

Contributor: Swanepoel, Konrad
Thomas, Doreen Anne
SpringerLink (Online service)

DOI: 10.1007/s10957-016-1036-5

URN: urn:nbn:de:1111-201612134223

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 11:03 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Ras, Charl
Swanepoel, Konrad
Thomas, Doreen Anne
SpringerLink (Online service)

Other Objects (12)

Computing Euclidean Steiner trees over segments

A Physarum-inspired approach to the Euclidean Steiner tree problem

Arbeitspapier

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

Arbeitspapier

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

A Physarum-inspired approach to the Euclidean Steiner tree problem

Arbeitspapier

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

Arbeitspapier

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

A Physarum-inspired approach to the Euclidean Steiner tree problem

Arbeitspapier

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

Arbeitspapier

Minimal Euclidean Networks with Flow Dependent Costs--The Generalized Steiner Case

Approximate minimum tree cover in all symmetric monotone norms simultaneously

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Approximate Euclidean Steiner Trees

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (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

Approximate minimum tree cover in all symmetric monotone norms simultaneously

Related objects

Reset password