F07 NetCmpx Sem02

From InterSciWiki

last week's seminar devoted to how engineering, computing, and social science approaches to problems often assume that easier algorithms provide better solutions.

We spent 2 hours on how hard to computing routing and cohesion algorithms deriving from Menger's 1927 theorem provide solutions to hard problems. Proofs, examples, applications.

A new problem for today might involve a simulation: the topic (hard problem) substantively might be titled "Redesigning road systems for global sustainability"

It begins with triangular rather than quadradic intersections, and optimal flow in planar graphs, i.e. low construction cost road systems that have low transport per time, distance and fuel.

This suggests ways of redesigning communities and ecologies with maximal non--road-interrupted open spaces for industry, agricultural, pastoralism, and community spaces, with population concentration, parking, and consumer outlets strictly along low-flow roads, and a possibility for complete absence if desired, of dead-ends.

The benefits to contemporary human social organization is explained.

Historical reasons for the current cross-hatch or quadratic road systems are examined.