Input wanted on algorithm strategy
From: Augustin Des (noadd_at_no.add)
Date: 02/18/04
- Next message: Lester Zick: "Re: Church-Turing compared to Zuse-Fredkin thesis (two new papers)"
- Previous message: FlicK: "URGENCY!!! Please HELP!"
- Next in thread: Dhruv Matani: "Re: Input wanted on algorithm strategy"
- Reply: Dhruv Matani: "Re: Input wanted on algorithm strategy"
- Reply: Rune Bang Lyngsoe: "Re: Input wanted on algorithm strategy"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Wed, 18 Feb 2004 20:49:21 GMT
Consider a bus route with k stops. When the bus starts itīs journey, p
persons are on the bus. Person j wants to get off at stop s_j<=k. Also
s_j>=1. However the bus canīt stop at more than z < k stops. So a person
who wants to get off at a stop s_j which is not among the z stops has to get
off at the nearest one and then walk.
The problem is now to construct a method(algorithm) where the bus stops at
stops so that the total amount of walking is minimized. Any ideas on a
decent strategy here ?
- Next message: Lester Zick: "Re: Church-Turing compared to Zuse-Fredkin thesis (two new papers)"
- Previous message: FlicK: "URGENCY!!! Please HELP!"
- Next in thread: Dhruv Matani: "Re: Input wanted on algorithm strategy"
- Reply: Dhruv Matani: "Re: Input wanted on algorithm strategy"
- Reply: Rune Bang Lyngsoe: "Re: Input wanted on algorithm strategy"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|