On the existence of shortest directed networks

Swanepoel, Konrad ORCID: 0000-0002-1668-887X (2000) On the existence of shortest directed networks. Journal of Combinatorial Mathematics and Combinatorial Computing, 33. pp. 97-102. ISSN 0835-3026

Full text not available from this repository.

Abstract

A digraph connecting a set A to a set B such that there is an a-b path for each a in A and b in B is a directed network. The author proves that for a finitely compact metric space in which geodesics exist, any two finite sets A and B are connected by a shortest directed network. A bound on the Steiner points is also established.

Item Type:	Article
Official URL:	http://www.charlesbabbage.org/
Additional Information:	© 2000 Charles Babbage Research Centre
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics
Date Deposited:	16 Oct 2009 09:34
Last Modified:	13 Sep 2024 21:18
URI:	http://eprints.lse.ac.uk/id/eprint/25467

Actions (login required)

View Item