Minimize the maximum duty in multi-interface networks (Q2429355): 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: The strong chromatic index of a cubic graph is at most 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy-Efficient Communication in Multi-interface Wireless Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic multi-level overlay graphs for shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar orientations with low out-degree and compaction of adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Constrained Multi-interface Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-Max Coverage in Multi-interface Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidynamic algorithms for maintaining single-source shortest path trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forests, frames, and games: Algorithms for matroid sums and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost minimization in wireless networks with a bounded and unbounded number of interfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genus g Graphs Have Pagenumber O(√g) / rank
 
Normal rank

Latest revision as of 03:39, 5 July 2024

scientific article
Language Label Description Also known as
English
Minimize the maximum duty in multi-interface networks
scientific article

    Statements

    Minimize the maximum duty in multi-interface networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    multi-interface network
    0 references
    energy saving
    0 references
    computational complexity
    0 references
    approximation algorithm
    0 references

    Identifiers