All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General
Neat Network II (Posted on 2013-04-05) Difficulty: 3 of 5
A,B,C and D are four cities such that ABCD has the precise shape of a square with each side equal to 100 kilometers.

A railway network needs to be constructed connecting all the cities. Determine the minimum total length of this network. Prove that this is indeed the minimum network length.

No Solution Yet Submitted by K Sengupta    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: A good browse.Larry2013-04-06 14:11:11
A good browse.Jer2013-04-05 22:10:41
Solutionassuming there's no other topological configurationCharlie2013-04-05 15:46:00
Hints/Tipssome thoughtsbroll2013-04-05 15:21:22
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information