17 citations · 29 across the 9 of their papers we have counts for
1 paper · 2 filters
Khaled Elbassioni, Rajiv Raman, Saurabh Ray +1
In the \emph{tollbooth problem}, we are given a tree $\bT=(V,E)$ with n edges, and a set of m customers, each of whom is interested in purchasing a path on the tree. Each custo…