Minimize the maximum duty in multi-interface networks

DOI10.1007/s00453-011-9531-4zbMath1236.68009MaRDI QIDQ2429355

Gabriele Di Stefano, Alfredo Navarra, Gianlorenzo D'Angelo

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9531-4

zbMATH Keywords

computational complexity; approximation algorithm; energy saving; multi-interface network

Mathematics Subject Classification ID

68M07: Mathematical problems of computer architecture

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Maximum matching in multi-interface networks

Cites Work

• Unnamed Item
• Dynamic multi-level overlay graphs for shortest paths
• Planar orientations with low out-degree and compaction of adjacency matrices
• Forests, frames, and games: Algorithms for matroid sums and applications
• The strong chromatic index of a cubic graph is at most 10
• Approximation algorithms for combinatorial problems
• Semidynamic algorithms for maintaining single-source shortest path trees
• Algorithmic construction of sets for k -restrictions
• Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
• Min-Max Coverage in Multi-interface Networks
• Bandwidth Constrained Multi-interface Networks
• Energy-Efficient Communication in Multi-interface Wireless Networks
• Genus g Graphs Have Pagenumber O(√g)
• Cost minimization in wireless networks with a bounded and unbounded number of interfaces
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth