
Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing
The current best algorithms for convex body chasing problem in online al...
read it

Structural Iterative Rounding for Generalized kMedian Problems
This paper considers approximation algorithms for generalized kmedian p...
read it

FullyDynamic Submodular Cover with Bounded Recourse
In submodular covering problems, we are given a monotone, nonnegative su...
read it

Online Carpooling using Expander Decompositions
We consider the online carpooling problem: given n vertices, a sequence ...
read it

Neutralizing SelfSelection Bias in Sampling for Sortition
Sortition is a political system in which decisions are made by panels of...
read it

Caching with Time Windows and Delays
We consider two generalizations of the classical weighted paging problem...
read it

DimensionFree Bounds on Chasing Convex Functions
We consider the problem of chasing convex functions, where functions arr...
read it

Optimal Bounds for the kcut Problem
In the kcut problem, we want to find the smallest set of edges whose de...
read it

RandomOrder Models
This chapter introduces the randomorder model in online algorithms. In ...
read it

Stochastic Makespan Minimization in Structured Set Systems
We study stochastic combinatorial optimization problems where the object...
read it

The KargerStein Algorithm is Optimal for kcut
In the kcut problem, we are given an edgeweighted graph and want to fi...
read it

Robust Algorithms for the Secretary Problem
In classical secretary problems, a sequence of n elements arrive in a un...
read it

The Number of Minimum kCuts: Improving the KargerStein Bound
Given an edgeweighted graph, how many minimum kcuts can it have? This ...
read it

Chasing Convex Bodies with Linear Competitive Ratio
We study the problem of chasing convex bodies online: given a sequence o...
read it

Nonclairvoyant Precedence Constrained Scheduling
We consider the online problem of scheduling jobs on identical machines,...
read it

Tight FPT Approximations for kMedian and kMeans
We investigate the finegrained complexity of approximating the classica...
read it

Stochastic Online Metric Matching
We study the minimumcost metric perfect matching problem under online i...
read it

Stochastic Load Balancing on Unrelated Machines
We consider the problem of makespan minimization on unrelated machines w...
read it

Spatiotemporal Filtering for EventBased Action Recognition
In this paper, we address the challenging problem of action recognition,...
read it

Spatiotemporal Feature Learning for EventBased Vision
Unlike conventional framebased sensors, eventbased visual sensors outp...
read it

Better Algorithms for Stochastic Bandits with Adversarial Corruptions
We study the stochastic multiarmed bandits problem in the presence of a...
read it

The Markovian Price of Information
Suppose there are n Markov chains and we need to pay a perstep price to...
read it

kServers with a Smile: Online Algorithms via Projections
We consider the kserver problem on trees and HSTs. We give an algorithm...
read it

Faster Exact and Approximate Algorithms for kCut
In the kcut problem, we are given an edgeweighted graph G and an integ...
read it

A NearlyLinear Bound for Chasing Nested Convex Bodies
Friedman and Linial introduced the convex body chasing problem to explor...
read it

NonPreemptive FlowTime Minimization via Rejections
We consider the online problem of minimizing weighted flowtime on unrel...
read it

Maximizing Profit with Convex Costs in the Randomorder Model
Suppose a set of requests arrives online: each request gives some value ...
read it

Losing Treewidth by Separating Subsets
We study the problem of deleting the smallest set S of vertices (resp.ed...
read it

PotentialFunction Proofs for FirstOrder Methods
This note discusses proofs for convergence of firstorder methods based ...
read it

FullyDynamic Bin Packing with Limited Repacking
We consider the bin packing problem in a fullydynamic setting, where ne...
read it

Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
We study the combinatorial pure exploration problem BestSet in stochast...
read it

Forest Density Estimation
We study graph estimation and density estimation in high dimensions, usi...
read it
Anupam Gupta
is this you? claim profile