The following pages link to Seeun William Umboh (Q832513):
Displaying 14 items.
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- Tight approximation bounds for dominating set on graphs of bounded arboricity (Q1675919) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← links)
- Nested convex bodies are chaseable (Q1987239) (← links)
- Timing matters: online dynamics in broadcast games (Q2190382) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Secretary Problems with Convex Costs (Q2843237) (← links)
- A Bicriteria Approximation for the Reordering Buffer Problem (Q2912837) (← links)
- Network Design with Coverage Costs (Q2969041) (← links)
- THRESHOLD RULES FOR ONLINE SAMPLE SELECTION (Q3084694) (← links)
- Tight Bounds for Online Weighted Tree Augmentation (Q5091248) (← links)
- The Online Broadcast Range-Assignment Problem (Q6065469) (← links)
- The online broadcast range-assignment problem (Q6088305) (← links)
- (Q6147549) (← links)
