A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-uniform multicommodity buy-at-bulk network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046489 / rank
 
Normal rank
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: On the approximability of some network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approaches for Virtual Private Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected facility location via random facility sampling and core detouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation for Single-Sink Buy-at-Bulk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design via Core Detouring for Problems without a Core / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant factor approximation for the single sink edge installation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler and better approximation algorithms for network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation via cost sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approximation Algorithm for the Selective Single-Sink Buy-at-Bulk Problem in Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized \(k\)-multicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sampling algorithms for network design / rank
 
Normal rank

Latest revision as of 15:44, 8 July 2024

scientific article
Language Label Description Also known as
English
A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
scientific article

    Statements

    A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (English)
    0 references
    0 references
    24 June 2014
    0 references
    buy-at-bulk
    0 references
    network design
    0 references
    approximation algorithm
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers