The strong chromatic index of a cubic graph is at most 10
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Routing in multi-radio, multi-hop wireless mesh networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Reconsidering wireless systems with multiple radios
ACM SIGCOMM Computer Communication Review
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Energetic performance of service-oriented multi-radio networks: issues and perspectives
WOSP '07 Proceedings of the 6th international workshop on Software and performance
Cheapest Paths in Multi-interface Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Energy-Efficient Communication in Multi-interface Wireless Networks
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Cost minimisation in multi-interface networks
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Cost minimisation in unbounded multi-interface networks
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Exploiting multi-interface networks: Connectivity and Cheapest Paths
Wireless Networks
Min-max coverage in multi-interface networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Bandwidth constrained multi-interface networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Hi-index | 0.00 |
In modern networks, devices are equipped with multiple wired or wireless interfaces. By switching among interfaces or by combining the available interfaces, each device might establish several connections. A connection is established when the devices at its endpoints share at least one active interface. Each interface is assumed to require an activation cost. In this paper, we consider the problem of guarantee the connectivity of a network G = (V, E) while keeping as low as possible the maximum cost set of active interfaces at the single nodes. Nodes V represent the devices, edges E represent the connections that can be established. We study the problem of minimizing the maximum cost set of active interfaces among the nodes of the network in order to ensure connectivity. We prove that the problem is NP-hard for any fixed Δ ≥ 3 and k ≥ 10, with Δ being the maximum degree, and k being the number of different interfaces among the network. We also show that the problem cannot be approximated within O(log |V|). We then provide approximation and exact algorithms for the general problem and for special cases, respectively.