Min-Max Coverage in Multi-interface Networks

DOI10.1007/978-3-642-18381-2_16zbMath1298.68199OpenAlexW1887678061MaRDI QIDQ3075516

Alfredo Navarra, Gabriele Di Stefano, Gianlorenzo D'Angelo

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00644084/file/MultiInterfacesCoverage.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Minimize the maximum duty in multi-interface networks ⋮ Energy-efficient communication in multi-interface wireless networks

Cites Work

• Unnamed Item
• Dynamic multi-level overlay graphs for shortest paths
• Planar orientations with low out-degree and compaction of adjacency matrices
• Approximation algorithms for combinatorial problems
• Semidynamic algorithms for maintaining single-source shortest path trees
• Minimizing the Maximum Duty for Connectivity in 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

This page was built for publication: Min-Max Coverage in Multi-interface Networks