Planar Manhattan local minimal and critical networks

Planar Manhattan local minimal and critical networks

0.00 Avg rating0 Votes
Article ID: iaor20042255
Country: Netherlands
Volume: 23
Issue: 8
Start Page Number: 949
End Page Number: 967
Publication Date: Aug 2002
Journal: Electronic Journal of Combinatorics
Authors: , ,
Abstract:

The authors consider a version of the minimum Steiner tree problem for the l1-induced distance function. A network connecting a given set of points in l1 space is called locally minimal if no auxiliary vertex of the network can be moved to decrease the total length. It is called critical if there is no infinitesimal perturbation of the network which would decrease the total length. The authors show that unlike in the case of the l2-induced distance, a locally minimal network does not have to be critical. They also demonstrate some properties of critical and locally minimal networks.

Reviews

Required fields are marked *. Your email address will not be published.