Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
DOI10.1007/978-3-642-17461-2_21zbMATH Open1311.90022OpenAlexW1522862982MaRDI QIDQ3066463FDOQ3066463
Authors: Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
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
Recommendations
- Minimize the maximum duty in multi-interface networks
- Cost Minimisation in Multi-interface Networks
- Min-max coverage in multi-interface networks
- Maximum matching in multi-interface networks
- Maximum matching in multi-interface networks
- Balancing energy consumption for the establishment of multi-interface networks
- Optimal routing for minimizing the maximal link congestion
Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Communication networks in operations research (90B18)
Cited In (8)
- Maximum matching in multi-interface networks
- Cost Minimisation in Multi-interface Networks
- Bandwidth constrained multi-interface networks
- Minimizing maximum risk for fair network connection with interval data
- Minimize the maximum duty in multi-interface networks
- Maximum matching in multi-interface networks
- Energy-efficient communication in multi-interface wireless networks
- Min-max coverage in multi-interface networks
This page was built for publication: Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066463)