[net.math] Looking for redundant-network generation algorithms

pete@octopus.UUCP (Pete Holzmann) (03/18/86)

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