activity
20172022
most citedDynamic Relaxations for Online Bipartite Matching

1 citations · 1 across the 5 of their papers we have counts for

collaborators

7 papers

cs.GT2022

The IID Prophet Inequality with Limited Flexibility

Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello

In online sales, sellers usually offer each potential buyer a posted price in a take-it-or-leave fashion. Buyers can sometimes see posted prices faced by other buyers, and changing…

cs.DS2022

Multi Purpose Routing: New Perspectives and Approximation Algorithms

Majid Farhadi, Jai Moondra, Prasad Tetali +1

The cost due to delay in services may be intrinsically different for various applications of vehicle routing such as medical emergencies, logistical operations, and ride-sharing. W…

cs.GT2021

Robust Online Selection with Uncertain Offer Acceptance

Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello

Online advertising has motivated interest in online selection problems. Displaying ads to the right users benefits both the platform (e.g., via pay-per-click) and the advertisers (…

cs.DS2021

The Traveling Firefighter Problem

Majid Farhadi, Alejandro Toriello, Prasad Tetali

We introduce the Traveling Salesman Problem (-TSP), given by an origin, a set of destinations, and underlying distances. The objective is to schedule a destination visit…

math.OC2020

Adaptive Bin Packing with Overflow

Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello

Motivated by bursty bandwidth allocation and by the allocation of virtual machines to servers in the cloud, we consider the online problem of packing items with random sizes into u…

cs.DS2018

Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency

Sebastian Perez-Salazar, Ishai Menache, Mohit Singh +1

Cloud computing has motivated renewed interest in resource allocation problems with new consumption models. A common goal is to share a resource, such as CPU or I/O bandwidth, amon…

math.OC2017★ 1 cited

Dynamic Relaxations for Online Bipartite Matching

Alfredo Torrico, Alejandro Toriello

Online bipartite matching (OBM) is a fundamental model underpinning many important applications, including search engine advertisement, website banner and pop-up ads, and ride-hail…