Static and dynamic routing under disjoint dominant extreme demands (Q631210): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029112512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing of uncertain traffic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of robust network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Least-Cost Nonblocking Broadband Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic vs. oblivious routing in network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Ratio for Group Steiner Trees and Directed Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Between Traffic Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On improving optimal oblivious routing / rank
 
Normal rank

Latest revision as of 22:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Static and dynamic routing under disjoint dominant extreme demands
scientific article

    Statements

    Static and dynamic routing under disjoint dominant extreme demands (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2011
    0 references
    0 references
    robust optimization
    0 references
    network design
    0 references
    Hose model
    0 references
    0 references
    0 references