Minimum-Cost Network Design with (Dis)economies of Scale (Q3464060): 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: Hallucination Helps: Energy Efficient Virtual Circuit Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed scaling to manage energy and temperature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934666 / 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: Multicommodity flow, well-linked terminals, and routing problems / 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: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design / 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: Approximation via cost sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph partitioning using single commodity flows / 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: Cluster before you hallucinate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Disjoint Paths in Moderately Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252722 / rank
 
Normal rank

Latest revision as of 09:12, 11 July 2024

scientific article
Language Label Description Also known as
English
Minimum-Cost Network Design with (Dis)economies of Scale
scientific article

    Statements

    Minimum-Cost Network Design with (Dis)economies of Scale (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    energy-efficient networks
    0 references
    diseconomies of scale
    0 references
    0 references