1 citations · 1 across the 6 of their papers we have counts for
6 papers
Online Computation of String Net Frequency
Peaker Guo, Seeun William Umboh, Anthony Wirth +1
The net frequency (NF) of a string, of length , in a text, of length , is the number of occurrences of the string in the text with unique left and right extensions. Recently,…
Nested Active-Time Scheduling
Nairen Cao, Jeremy T. Fineman, Shi Li +3
The active-time scheduling problem considers the problem of scheduling preemptible jobs with windows (release times and deadlines) on a parallel machine that can schedule up to …
LAST but not Least: Online Spanners for Buy-at-Bulk
Anupam Gupta, R. Ravi, Kunal Talwar +1
The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-costs exhibit economy-of-scale. Previous approaches to this problem used tree- e…
Online Network Design Algorithms via Hierarchical Decompositions
Seeun Umboh
We develop a new approach for online network design and obtain improved competitive ratios for several problems. Our approach gives natural deterministic algorithms and simple anal…
A Bicriteria Approximation for the Reordering Buffer Problem
Siddharth Barman, Shuchi Chawla, Seeun Umboh
In the reordering buffer problem (RBP), a server is asked to process a sequence of requests lying in a metric space. To process a request the server must move to the corresponding…
Threshold rules for online sample selection
Eric Bach, Shuchi Chawla, Seeun Umboh
We consider the following sample selection problem. We observe in an online fashion a sequence of samples, each endowed by a quality. Our goal is to either select or reject each sa…