Cost minimization in wireless networks with a bounded and unbounded number of interfaces

DOI10.1002/net.20266zbMath1178.68039OpenAlexW4245779040MaRDI QIDQ5191147

Alfredo Navarra, Adrian Kosowski, Ralf Klasing

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20266

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

Energy-Efficient Communication in Multi-interface Wireless Networks ⋮ Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks ⋮ Maximum matching in multi-interface networks ⋮ Minimize the maximum duty in multi-interface networks ⋮ Energy-efficient communication in multi-interface wireless networks ⋮ Matchings with lower quotas: algorithms and complexity ⋮ On the complexity of core, kernel, and bargaining set ⋮ Min-Max Coverage in Multi-interface Networks ⋮ Bandwidth Constrained Multi-interface Networks

Cites Work

• Structure preserving reductions among convex optimization problems
• Optimization, approximation, and complexity classes
• Smallest-last ordering and clustering and graph coloring algorithms
• A new approach to the maximum-flow problem
• Approximation algorithms for NP-complete problems on planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item