Steiner Minimal Trees - Dietmar Cieslik
Stockfoto
KORTE INHOUD
The problem of "Shortest Connectivity", which is discussed here, has a long and convoluted history. Many scientists from many fields as well as laymen have stepped on its stage. Usually, the problem is known as Steiner's Problem and it can be described more precisely in the following way: Given a finite set of points in a metric space, search for a network that connects these points with the shortest possible length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may con...
Taal: Engels zie alle details...
Koop dit boek tweedehands
bij volgende verkopers
gerelateerde boeken