Bandwidth Constrained Multi-interface Networks

DOI10.1007/978-3-642-18381-2_17zbMath1298.68200OpenAlexW1528291559MaRDI QIDQ3075517

Gianlorenzo D'Angelo, Alfredo Navarra, Gabriele Di Stefano

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://doi.org/10.1007/978-3-642-18381-2_17

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 (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
• Energy-Efficient Communication in Multi-interface Wireless Networks
• Cost minimization in wireless networks with a bounded and unbounded number of interfaces

This page was built for publication: Bandwidth Constrained Multi-interface Networks