Approximating minimum Steiner point trees in Minkowski planes (Q3064040): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for NP-hard geometric optimization problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Steiner trees for rectangular arrays of lattice points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical forms and algorithms for Steiner trees in uniform orientation metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for Steiner trees with minimum number of Steiner points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wire segmenting for buffer insertion based on RSTP-MSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fermat--Torricelli problem in normed planes and spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck Steiner trees in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Steiner minimum trees: An improved exact algorithm / rank
 
Normal rank

Latest revision as of 14:35, 3 July 2024

scientific article
Language Label Description Also known as
English
Approximating minimum Steiner point trees in Minkowski planes
scientific article

    Statements

    Identifiers