S. Umboh

activity

20172020

collaborators

4 papers

cs.CG2020

The Online Broadcast Range-Assignment Problem

Mark de Berg, Aleksandar Markovic, Seeun William Umboh

Let $P = {p_{0}, \dots, p_{n - 1}}$ be a set of points in $R^{d}$ , modeling devices in a wireless network. A range assignment assigns a range $r (p_{i})$ to each point $p_{i} \in P$ , t…

cs.DS2019

Tight Bounds for Online Weighted Tree Augmentation

Joseph, Naor, Seeun William Umboh +1

The Weighted Tree Augmentation problem (WTAP) is a fundamental problem in network design. In this paper, we consider this problem in the online setting. We are given an $n$ -vertex…

cs.DS2017

Nested Convex Bodies are Chaseable

Nikhil Bansal, Martin Böhm, Marek Eliáš +2

In the Convex Body Chasing problem, we are given an initial point $v_{0}$ in $R^{d}$ and an online sequence of $n$ convex bodies $F_{1}, ..., F_{n}$ . When we receive $F_{i}$ , we are required…

cs.DS2017

Online Constrained Forest and Prize-Collecting Network Design

Jiawei Qian, Seeun William Umboh, David P. Williamson

In this paper, we study a very general type of online network design problem, and generalize two different previous algorithms, one for an online network design problem due to Berm…