Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!allegra!mit-eddie!think!harvard!seismo!ut-sally!pyramid!octopus!pete
From: pete@octopus.UUCP (Pete Holzmann)
Newsgroups: net.math,net.wanted.sources,net.mail
Subject: Looking for redundant-network generation algorithms
Message-ID: <200@octopus.UUCP>
Date: Tue, 18-Mar-86 14:10:20 EST
Article-I.D.: octopus.200
Posted: Tue Mar 18 14:10:20 1986
Date-Received: Fri, 21-Mar-86 04:33:47 EST
Reply-To: pete@octopus.UUCP (Pete Holzmann)
Followup-To: net.math
Organization: Octopus Enterprises, Cupertino, CA
Lines: 25
Xref: watmath net.math:2983 net.wanted.sources:2043 net.mail:1471


I'm looking for algorithms (and hopefully source code) that solve the
following problem:

Given:
	- A set of N nodes
	- An internode 'distance' matrix
	- Desired network redundancy factor J (1..n)

We want:
	- The set of arcs (internode links) connecting all nodes with
		the following properties:

			- sum of arc distances is a minimum
			- There exist at least J independant paths between
				any two nodes


Please respond by mail, as I don't normally subscribe to
these groups! I will summarize to net.math  if there is demand.
-- 
  OOO   __| ___      Peter Holzmann, Octopus Enterprises
 OOOOOOO___/ _______ USPS: 19611 La Mar Court, Cupertino, CA 95014
  OOOOO \___/        UUCP: {hplabs!hpdsd,pyramid}!octopus!pete
___| \_____          Phone: 408/996-7746