Optimal and approximate bottleneck Steiner trees (Q1362990): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126376883, #quickstatements; #temporary_batch_1723807531120
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layout of facilities with some fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner’s Problem with Rectilinear Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck Steiner trees in the plane / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126376883 / rank
 
Normal rank

Latest revision as of 12:29, 16 August 2024

scientific article
Language Label Description Also known as
English
Optimal and approximate bottleneck Steiner trees
scientific article

    Statements

    Optimal and approximate bottleneck Steiner trees (English)
    0 references
    0 references
    0 references
    7 August 1997
    0 references
    geometric algorithms
    0 references
    minmax multicenter
    0 references
    bottleneck Steiner tree
    0 references
    facility location
    0 references

    Identifiers