Competitive and deterministic embeddings of virtual networks (Q391268): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Network information flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line routing of virtual circuits with applications to load balancing and machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive routing of virtual circuits with unknown duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum congestion mapping in a cloud / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Covering and Packing / 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: A survey of network virtualization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Multi-Commodity Flow with High Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Least-Cost Nonblocking Broadband Networks / 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: Simpler and better approximation algorithms for network design / 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 Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on approximating the Steiner tree problem and its generalizations / rank
 
Normal rank

Latest revision as of 04:46, 7 July 2024

scientific article
Language Label Description Also known as
English
Competitive and deterministic embeddings of virtual networks
scientific article

    Statements

    Competitive and deterministic embeddings of virtual networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    network virtualization
    0 references
    online algorithms
    0 references
    primal-dual approach
    0 references
    linear programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references