The repeater tree construction problem (Q1675870): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.ipl.2010.08.016 / rank | |||
Property / author | |||
Property / author: Stephan Held / rank | |||
Property / author | |||
Property / author: Jens Maßberg / rank | |||
Property / author | |||
Property / author: Jens Vygen / rank | |||
Property / author | |||
Property / author: Stephan Held / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Jens Maßberg / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Jens Vygen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1972057929 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line Steiner trees in the Euclidean plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Steiner Minimal Trees with Rectilinear Distance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binary trees with choosable edge lengths / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.IPL.2010.08.016 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:40, 11 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The repeater tree construction problem |
scientific article |
Statements
The repeater tree construction problem (English)
0 references
3 November 2017
0 references
analysis of algorithms
0 references
interconnection networks
0 references
VLSI design
0 references
repeater tree
0 references
Steiner tree
0 references
minimum spanning tree
0 references