11 citations
2 papers
cs.LG2014★ 11 cited
Optimal Resource Allocation with Semi-Bandit Feedback
Tor Lattimore, Koby Crammer, Csaba Szepesvári
We study a sequential resource allocation problem involving a fixed number of recurring jobs. At each time-step the manager should distribute available resources among the jobs in…
cs.DS2012★ 3 cited
A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem
Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh
In the k-arc connected subgraph problem, we are given a directed graph G and an integer k and the goal is the find a subgraph of minimum cost such that there are at least k-arc dis…