An important class of problems that occur in different fields of research deal with the problem of finding an interconnection of a given set of objects.
In this talk we discuss NP-hard problems of that kind, such as the exact computation of Steiner minimum trees in Hamming metric and approximation algorithms for power assignment problems occurring in the design of wireless communication networks.