Minimize the maximum duty in multi-interface networks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Algorithmic construction of sets for k -restrictions
- Approximation algorithms for combinatorial problems
- Bandwidth constrained multi-interface networks
- Cost minimization in wireless networks with a bounded and unbounded number of interfaces
- Dynamic multi-level overlay graphs for shortest paths
- Energy-Efficient Communication in Multi-interface Wireless Networks
- Forests, frames, and games: Algorithms for matroid sums and applications
- Genus g Graphs Have Pagenumber O(√g)
- Min-max coverage in multi-interface networks
- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
- Planar orientations with low out-degree and compaction of adjacency matrices
- Semidynamic algorithms for maintaining single-source shortest path trees
- The strong chromatic index of a cubic graph is at most 10
Cited in
(9)- Maximum matching in multi-interface networks
- Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
- Cost Minimisation in Multi-interface Networks
- Bandwidth constrained multi-interface networks
- Maximum matching in multi-interface networks
- Energy-Efficient Communication in Multi-interface Wireless Networks
- Energy-efficient communication in multi-interface wireless networks
- Min-max coverage in multi-interface networks
- Balancing energy consumption for the establishment of multi-interface networks
This page was built for publication: Minimize the maximum duty in multi-interface networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429355)