16 citations · 17 across the 3 of their papers we have counts for
3 papers
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…
Capacitated Vehicle Routing with Non-Uniform Speeds
Inge Li Gortz, Marco Molinaro, Viswanath Nagarajan +1
The capacitated vehicle routing problem (CVRP) involves distributing (identical) items from a depot to a set of demand locations, using a single capacitated vehicle. We study a gen…
On the Complexity of Searching in Trees: Average-case Minimization
Ferdinando Cicalese, Tobias Jacobs, Eduardo Laber +1
We focus on the average-case analysis: A function w : V -> Z+ is given which defines the likelihood for a node to be the one marked, and we want the strategy that minimizes the exp…