Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approximation algorithm for the survivable network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for bicategories, with application to speeding up an approximation algorithm / rank
 
Normal rank

Revision as of 14:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
scientific article

    Statements

    Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2010
    0 references
    approximation algorithms
    0 references
    primal-dual method
    0 references
    prize-collecting Steiner tree
    0 references

    Identifiers