Approximations and lower bounds for the length of minimal Euclidean Steiner trees (Q2457920): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10898-005-4207-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2047041799 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper and lower bounds for the lengths of Steiner trees in 3-space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Generation of Minimal Trees with a Steiner Topology / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Distance between Two Ellipsoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How to find Steiner minimal trees in Euclidean \(d\)-space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank | |||
Normal rank |
Latest revision as of 11:46, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximations and lower bounds for the length of minimal Euclidean Steiner trees |
scientific article |
Statements
Approximations and lower bounds for the length of minimal Euclidean Steiner trees (English)
0 references
23 October 2007
0 references