Steiner trees in uniformly quasi-bipartite graphs. (Q1853068): 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: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of nearly minimal Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / 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:21, 5 June 2024

scientific article
Language Label Description Also known as
English
Steiner trees in uniformly quasi-bipartite graphs.
scientific article

    Statements

    Steiner trees in uniformly quasi-bipartite graphs. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Analysis of algorithms
    0 references
    Approximation algorithms
    0 references
    Network design
    0 references
    Steiner tree problem in graphs
    0 references