A faster approximation algorithm for the Steiner problem in graphs (Q5903117): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of a result of Pollak on Steiner minimal trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank

Latest revision as of 14:19, 17 June 2024

scientific article; zbMATH DE number 3952028
Language Label Description Also known as
English
A faster approximation algorithm for the Steiner problem in graphs
scientific article; zbMATH DE number 3952028

    Statements

    A faster approximation algorithm for the Steiner problem in graphs (English)
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree
    0 references
    distance graph
    0 references
    generalized minimum spanning tree
    0 references