In the  tollbooth problem on trees  , we are given a tree T= ( V  , E  ) with  n  edges, and a set of  m  customers, each of whom is interested in purchasing a path on the graph. Each customer has a fixed budget, and the objective is to price the edges of T such that the total revenue made by selling the paths to the customers that can afford them is maximized. An important special case of this problem, known as the  highway problem  , is when T is restricted to be a line. For the tollbooth problem, we present an  O  (log n  )-approximation, improving on the current best  O  (log m  )-approximation. We also study a special case of the tollbooth problem, when all the paths that customers are interested in purchasing go towards a fixed root of T. In this case, we present an algorithm that returns a (1 ***  ***  )-approximation, for any  ***  > 0, and runs in quasi-polynomial time. On the other hand, we rule out the existence of an FPTAS by showing that even for the line case, the problem is strongly NP-hard. Finally, we show that in the  discount model  , when we allow some items to be priced below zero to improve the overall profit, the problem becomes even APX-hard.
['Khaled M. Elbassioni', 'Rajiv Raman', 'Saurabh Ray', 'René Sitters']
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems