Author of the publication

A Bicriteria Approximation for the Reordering Buffer Problem.

, , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 157-168. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Umboh, Seeun
add a person with the name Umboh, Seeun
 

Other publications of authors with the same name

A Bicriteria Approximation for the Reordering Buffer Problem., , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 157-168. Springer, (2012)Secretary Problems with Convex Costs., , , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 75-87. Springer, (2012)Network Design with Coverage Costs., , and . APPROX-RANDOM, volume 28 of LIPIcs, page 48-63. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Threshold Rules for Online Sample Selection., , and . COCOON, volume 6196 of Lecture Notes in Computer Science, page 489-499. Springer, (2010)Secretary Problems with Convex Costs, , , and . CoRR, (2011)Online Network Design Algorithms via Hierarchical Decompositions.. SODA, page 1373-1387. SIAM, (2015)The Online Broadcast Range-Assignment Problem., , and . ISAAC, volume 181 of LIPIcs, page 60:1-60:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)LAST but not Least: Online Spanners for Buy-at-Bulk., , , and . SODA, page 589-599. SIAM, (2017)Online Constrained Forest and Prize-Collecting Network Design., , and . Algorithmica, 80 (11): 3335-3364 (2018)LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs., , and . SODA, page 1964-1979. SIAM, (2017)