Login / Signup
The minimum cost network upgrade problem with maximum robustness to multiple node failures.
Fábio Barbosa
Agostinho Agra
Amaro de Sousa
Published in:
Comput. Oper. Res. (2021)
Keyphrases
</>
minimum cost
network flow problem
network flow
spanning tree
np hard
node failures
approximation algorithms
peer to peer
special case
congestion control
minimum cost path
computational complexity
wireless sensor networks
response time
communication networks