Network design with a discrete set of traffic matrices (Q2450673): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing of uncertain traffic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicuts and integral multiflows in rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Robust Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of robust network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / 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: Designing Least-Cost Nonblocking Broadband Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for node-capacitated ring routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Capacitated Ring Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and integrality gaps for hypergraphic steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for requirement cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of trees in the hose model: the balanced case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compact formulation of the ring loading problem with integer demand splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Between Traffic Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete MAXSAT problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Asymmetric VPN Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ring Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity Flows in Ring Networks / rank
 
Normal rank

Latest revision as of 12:09, 8 July 2024

scientific article
Language Label Description Also known as
English
Network design with a discrete set of traffic matrices
scientific article

    Statements

    Network design with a discrete set of traffic matrices (English)
    0 references
    0 references
    0 references
    0 references
    14 May 2014
    0 references
    robust network design
    0 references
    ring network
    0 references
    single source demands
    0 references
    0 references
    0 references

    Identifiers