1 citations · 1 across the 8 of their papers we have counts for
4 papers · 1 filter
Steiner Forest: A Simplified Better-Than-2 Approximation
Anupam Gupta, Vera Traub
In the Steiner Forest problem, we are given a graph with edge lengths, and a collection of demand pairs; the goal is to find a subgraph of least total length such that each demand…
A Learning Perspective on Random-Order Covering Problems
Anupam Gupta, Marco Molinaro, Matteo Russo
In the random-order online set cover problem, the instance with sets and elements is chosen in a worst-case fashion, but then the elements arrive in a uniformly random orde…
Why is My Route Different Today? An Algorithm for Explaining Route Selection
Aaron Schild, Sreenivas Gollapudi, Anupam Gupta +2
Users of routing services like Apple Maps, Google Maps, and Waze frequently wonder why a given route is proposed. This question particularly arises when dynamic conditions like tra…
Multi-Platform Autobidding with and without Predictions
Gagan Aggarwal, Anupam Gupta, Xizhi Tan +1
We study the problem of finding the optimal bidding strategy for an advertiser in a multi-platform auction setting. The competition on a platform is captured by a value and a cost…