57 citations · 154 across the 36 of their papers we have counts for
3 papers · 1 filter
The Query-commit Problem
Marco Molinaro, R. Ravi
In the query-commit problem we are given a graph where edges have distinct probabilities of existing. It is possible to query the edges of the graph, and if the queried edge exists…
Minimum Makespan Multi-vehicle Dial-a-Ride
Inge Li Goertz, Viswanath Nagarajan, R. Ravi
Dial a ride problems consist of a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs, where each object requires to…
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro +1
In the stochastic knapsack problem, we are given a knapsack of size B, and a set of jobs whose sizes and rewards are drawn from a known probability distribution. However, we know t…