A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4763418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast approximation algorithm for the multicovering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / 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 17:44, 23 May 2024

scientific article
Language Label Description Also known as
English
A primal-dual approximation algorithm for generalized Steiner network problems
scientific article

    Statements

    A primal-dual approximation algorithm for generalized Steiner network problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 1995
    0 references
    0 references
    polynomial-time approximation algorithm
    0 references
    minimum-cost subgraph
    0 references
    generalized Steiner network problem
    0 references
    survivable network design
    0 references