research
∙
05/02/2023
Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering
We present a new multi-layer peeling technique to cluster points in a me...
share
research
∙
04/13/2023
List Update with Delays or Time Windows
We consider the problem of List Update, one of the most fundamental prob...
research
∙
10/13/2022
An α-regret analysis of Adversarial Bilateral Trade
We study sequential bilateral trade where sellers and buyers valuations ...
research
∙
12/22/2021
Online Graph Algorithms with Predictions
Online algorithms with predictions is a popular and elegant framework fo...
research
∙
09/17/2021
Distortion-Oblivious Algorithms for Minimizing Flow Time
We consider the classic online problem of scheduling on a single machine...
research
∙
03/09/2021
Flow Time Scheduling with Uncertain Processing Time
We consider the problem of online scheduling on a single machine in orde...
research
∙
01/26/2021
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering
Recently, Hierarchical Clustering (HC) has been considered through the l...
research
∙
11/03/2020
The Min-Cost Matching with Concave Delays Problem
We consider the problem of online min-cost perfect matching with concave...
research
∙
06/02/2020
Hierarchical Clustering: a 0.585 Revenue Approximation
Hierarchical Clustering trees have been widely accepted as a useful form...
research
∙
04/16/2020
Beyond Tree Embeddings – a Deterministic Framework for Network Design with Deadlines or Delay
We consider network design problems with deadline or delay. All previous...
research
∙
04/15/2019
General Framework for Metric Optimization Problems with Delay or with Deadlines
In this paper, we present a framework used to construct and analyze algo...
research
∙
07/23/2018
Set Cover and Vertex Cover with Delay
The set cover problem is one of the most fundamental problems in compute...
research
∙
06/10/2018
Deterministic Min-Cost Matching with Delays
We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) ...
research
∙
12/29/2017
Improved Online Algorithm for Weighted Flow Time
We discuss one of the most fundamental scheduling problem of processing ...
research
∙
11/06/2017
Prophet Secretary: Surpassing the 1-1/e Barrier
In the Prophet Secretary problem, samples from a known set of probabilit...
research
∙
10/02/2017