Min-Max Coverage in Multi-interface Networks
From MaRDI portal
Publication:3075516
DOI10.1007/978-3-642-18381-2_16zbMath1298.68199MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Energy-efficient communication in multi-interface wireless networks, Minimize the maximum duty 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
- 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