10 citations · 16 across the 4 of their papers we have counts for
1 paper · 1 filter
Matthias Bentert, René van Bevern, André Nichterlein +2
We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless communication network: Given an edge-weighted n-vertex graph, fin…