17 citations · 24 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
Point Line Cover: The Easy Kernel is Essentially Tight
Stefan Kratsch, Geevarghese Philip, Saurabh Ray
The input to the NP-hard Point Line Cover problem (PLC) consists of a set of points on the plane and a positive integer , and the question is whether there exists a set…
cs.DS2009★ 17 cited
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
Khaled Elbassioni, Rajiv Raman, Saurabh Ray +1
In the \emph{tollbooth problem}, we are given a tree $\bT=(V,E)$ with edges, and a set of customers, each of whom is interested in purchasing a path on the tree. Each custo…