4 citations · 5 across the 4 of their papers we have counts for
6 papers
Dynamic Edge Coloring of Forests
Haim Kaplan, David Naori, Yaniv Sadeh
In the \emph{dynamic edge coloring} problem, one has to maintain a graph of maximum degree with at most colors, under edge updates. A prominent objective is to minimize t…
Almost Tight Bounds for Online Facility Location in the Random-Order Model
Haim Kaplan, David Naori, Danny Raz
We study the online facility location problem with uniform facility costs in the random-order model. Meyerson's algorithm [FOCS'01] is arguably the most natural and simple online a…
Online Weighted Matching with a Sample
Haim Kaplan, David Naori, Danny Raz
We study the greedy-based online algorithm for edge-weighted matching with (one-sided) vertex arrivals in bipartite graphs, and edge arrivals in general graphs. This algorithm was…
Answer Identification in Collaborative Organizational Group Chat
Naama Tepper, Naama Zwerdling, David Naori +1
We present a simple unsupervised approach for answer identification in organizational group chat. In recent years, organizational group chat is on the rise enabling asynchronous te…
Competitive Analysis with a Sample and the Secretary Problem
Haim Kaplan, David Naori, Danny Raz
We extend the standard online worst-case model to accommodate past experience which is available to the online player in many practical scenarios. We do this by revealing a random…
Online Multidimensional Packing Problems in the Random-Order Model
David Naori, Danny Raz
We study online multidimensional variants of the generalized assignment problem which are used to model prominent real-world applications, such as the assignment of virtual machine…