13 citations · 60 across the 31 of their papers we have counts for
25 papers · 1 filter
Optimal Convergence of Iterative Methods for Datalogo
Simon Frisk, Sungjin Im, Paraschos Koutris +4
has been introduced as an extension to Datalog that increases expressiveness, yet retains simple least fixpoint semantics and admits optimization technique…
Controlling Tail Risk in Online Ski-Rental
Michael Dinitz, Sungjin Im, Thomas Lavastida +2
The classical ski-rental problem admits a textbook 2-competitive deterministic algorithm, and a simple randomized algorithm that is -competitive in expectation. The…
Online Dynamic Acknowledgement with Learned Predictions
Sungjin Im, Benjamin Moseley, Chenyang Xu +1
We revisit the online dynamic acknowledgment problem. In the problem, a sequence of requests arrive over time to be acknowledged, and all outstanding requests can be satisfied simu…
Min-max Submodular Ranking for Multiple Agents
Qingyun Chen, Sungjin Im, Benjamin Moseley +2
In the submodular ranking (SR) problem, the input consists of a set of submodular functions defined on a ground set of elements. The goal is to order elements for all the functions…
Improved Approximations for Unrelated Machine Scheduling
Sungjin Im, Shi Li
We revisit two well-studied scheduling problems in the unrelated machines setting where each job can have a different processing time on each machine. For minimizing total weighted…
Optimizing Polymatroid Functions
Sungjin Im, Benjamin Moseley, Hung Q. Ngo +2
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference const…