模式的道路網とそれを用いた最短巡回路の長さに関する考察

抄録

We minimize the total length of the circuit through n points randomly placed by using road networks. The upper bound for the circuit length is given by 2 √<nS> if S is an area. of the convex region with n points. We also show that this upper bound is constant for various kinds of network patterns.