The Optimal Design of Low-Latency Virtual Backbones (Q5148180): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithmic construction of sets for <i>k</i> -restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-bounded cuts and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On connected dominating sets of restricted diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Regenerator Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected dominating set. Theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum-leaf spanning tree problem: Formulations and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault diameter of interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of strongly connected dominating sets in asymmetric multihop wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regenerator location problem: polyhedral study and effective branch-and-cut algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mengerian theorems for paths of bounded length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max flows in O(nm) time, or better / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious formulations for low-diameter clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominating sets whose induced subgraphs have a bounded diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter increase caused by edge deletion / 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 Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer priority queues with decrease key in constant time and the single source shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault diameter of Cartesian product graphs / rank
 
Normal rank

Latest revision as of 11:06, 24 July 2024

scientific article; zbMATH DE number 7303816
Language Label Description Also known as
English
The Optimal Design of Low-Latency Virtual Backbones
scientific article; zbMATH DE number 7303816

    Statements

    The Optimal Design of Low-Latency Virtual Backbones (English)
    0 references
    0 references
    0 references
    1 February 2021
    0 references
    connected dominating set
    0 references
    strongly connected dominating set
    0 references
    latency
    0 references
    delay
    0 references
    hop constraint
    0 references
    \(k\)-club
    0 references
    length-bounded cut
    0 references
    wireless networks
    0 references
    fault-tolerant
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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