Approximating Steiner Networks with Node Weights (Q5458547): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design networks with bounded pairwise distance / 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: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128880 / 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: Improved methods for approximating node weighted Steiner trees and connected dominating sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power optimization for connectivity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Some Network Design Problems with Node Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for constrained for constrained node weighted steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank

Latest revision as of 21:23, 27 June 2024

scientific article; zbMATH DE number 5263926
Language Label Description Also known as
English
Approximating Steiner Networks with Node Weights
scientific article; zbMATH DE number 5263926

    Statements

    Approximating Steiner Networks with Node Weights (English)
    0 references
    15 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references