BurgerKing's is considering opening a series of restaurants along RiverSide Freeway. The n possible locations are along a straight line, and the distances of these locations from the start of RiverSide Freeway are, in miles and in increasing order,m1;m2; : : : ;mn. The constraints are as follows: At each location, BurgerKing's may open at most one restaurant. The expected profit from opening a restaurant at location i is pi, where pi > 0 and i = 1; 2; : : : ; n. Any two restaurants should be at least k miles apart, where k is a positive integer. what is an efficient algorithm to compute the maximum expected total profit subject to the given constraints. any help would be appriciated
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
