Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks

DOI10.1007/978-3-642-17461-2_21zbMath1311.90022OpenAlexW1522862982MaRDI QIDQ3066463

Gabriele Di Stefano, Alfredo Navarra, Gianlorenzo D'Angelo

Publication date: 10 January 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_21

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Minimize the maximum duty in multi-interface networks ⋮ Energy-efficient communication in multi-interface wireless networks ⋮ Min-Max Coverage in Multi-interface Networks ⋮ Bandwidth Constrained Multi-interface Networks

This page was built for publication: Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks