Skip to main content
Seeun William Umboh on Muck Rack

Seeun William Umboh

Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Seeun William

Contact Seeun William, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Computer Science > Data Structures and Algorithms

|
By Seeun William Umboh, Xiao Sun
| arxiv.org
We consider the parametrized setting of the classical metrical service system (MSS) problem first studied by Bubeck and Rabani (APPROX/RANDOM 2020). In this setting, the adversary is restricted to a set of $m$ distinct request types, known to the algorithm in advance. The goal is to obtain competitive ratio bounds in terms of $m$.
Open in Who Shared Issue with article?

Computer Science > Data Structures and Algorithms

|
By Seeun William Umboh, Xiao Sun
| arxiv.org
We study the online min-cost perfect matching with delay (MPMD) problem where $m$ requests arrive in a metric space of $n$ points. In MPMD, an algorithm can choose to match a request or to delay, and the objective is to minimise the sum of connection and delay costs.
Open in Who Shared Issue with article?

Computer Science > Data Structures and Algorithms

|
By Seeun William Umboh, Michał Pawłowski
| arxiv.org
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (452) Issue with article?
See all 9 articles