research
∙
08/02/2023
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
A spanning tree T of graph G is a ρ-approximate universal Steiner tree (...
share
research
∙
07/26/2022
Approximation Algorithms for Scheduling under Non-Uniform Machine-Dependent Delays
We consider the problem of scheduling precedence-constrained jobs on het...
research
∙
06/11/2022
Online Paging with Heterogeneous Cache Slots
It is natural to generalize the k-Server problem by allowing each reques...
research
∙
11/16/2021
Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints
We study flow scheduling under node capacity constraints. We are given c...
research
∙
03/22/2021
HaPPY-Mine: Designing a Mining Reward Function
In cryptocurrencies, the block reward is meant to serve as the incentive...
research
∙
11/05/2020
Competitive Data-Structure Dynamization
Data-structure dynamization is a general approach for making static data...
research
∙
05/19/2020
Scheduling Flows on a Switch to Optimize Response Times
We study the scheduling of flows on a switch with the goal of optimizing...
research
∙
04/22/2020
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
We consider the problem of scheduling n precedence-constrained jobs on m...
research
∙
04/26/2019