There is an east-west street of length L units. And we park cars of unit length along the north side until we can't place any more cars. Each car is placed randomly (uniformly).

What is the expected number of cars that can be parked (as a function of L)?
__________________________

I'll start you off...

For 0 <= L < 1, F(L) = 0
For 1 <= L < 2, F(L) = 1

Okay... now the easy ones are out of the way, can you describe the function for L>=2?

    74.6%..renyi's car parking problem. I used this result to analyse a clustering algorithm occuring in Ad Hoc networking:)
visit www.ece.rice.edu/~muhammed

Posted by Ahamed on 2004-07-09 01:52:40