1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2009★ 1 cited
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
Patrick Briest, Sanjeev Khanna
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may…
cs.DS2008
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
Ashish Goel, Michael Kapralov, Sanjeev Khanna
In this paper we further investigate the well-studied problem of finding a perfect matching in a regular bipartite graph. The first non-trivial algorithm, with running time …