Published in: LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)
Lindsey Deryckere and Seeun William Umboh. Online Matching with Set and Concave Delays. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 17:1-17:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{deryckere_et_al:LIPIcs.APPROX/RANDOM.2023.17, author = {Deryckere, Lindsey and Umboh, Seeun William}, title = {{Online Matching with Set and Concave Delays}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {17:1--17:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-296-9}, ISSN = {1868-8969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.17}, URN = {urn:nbn:de:0030-drops-188423}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.17}, annote = {Keywords: online algorithms, matching, delay, non-clairvoyant} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Nairen Cao, Jeremy T. Fineman, Shi Li, Julián Mestre, Katina Russell, and Seeun William Umboh. Nested Active-Time Scheduling. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{cao_et_al:LIPIcs.ISAAC.2022.36, author = {Cao, Nairen and Fineman, Jeremy T. and Li, Shi and Mestre, Juli\'{a}n and Russell, Katina and Umboh, Seeun William}, title = {{Nested Active-Time Scheduling}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.36}, URN = {urn:nbn:de:0030-drops-173214}, doi = {10.4230/LIPIcs.ISAAC.2022.36}, annote = {Keywords: Scheduling algorithms, Active time, Approximation algorithm} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Ryder Chen, Jahanvi Khatkar, and Seeun William Umboh. Online Weighted Cardinality Joint Replenishment Problem with Delay. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 40:1-40:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chen_et_al:LIPIcs.ICALP.2022.40, author = {Chen, Ryder and Khatkar, Jahanvi and Umboh, Seeun William}, title = {{Online Weighted Cardinality Joint Replenishment Problem with Delay}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {40:1--40:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.40}, URN = {urn:nbn:de:0030-drops-163815}, doi = {10.4230/LIPIcs.ICALP.2022.40}, annote = {Keywords: Online Algorithms, Delay, Joint Replenishment Problem} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Julián Mestre, Sergey Pupyrev, and Seeun William Umboh. On the Extended TSP Problem. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 42:1-42:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{mestre_et_al:LIPIcs.ISAAC.2021.42, author = {Mestre, Juli\'{a}n and Pupyrev, Sergey and Umboh, Seeun William}, title = {{On the Extended TSP Problem}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.42}, URN = {urn:nbn:de:0030-drops-154751}, doi = {10.4230/LIPIcs.ISAAC.2021.42}, annote = {Keywords: profile-guided optimization, approximation algorithms, bandwidth, TSP} }
Published in: LIPIcs, Volume 181, 31st International Symposium on Algorithms and Computation (ISAAC 2020)
Mark de Berg, Aleksandar Markovic, and Seeun William Umboh. The Online Broadcast Range-Assignment Problem. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 60:1-60:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{deberg_et_al:LIPIcs.ISAAC.2020.60, author = {de Berg, Mark and Markovic, Aleksandar and Umboh, Seeun William}, title = {{The Online Broadcast Range-Assignment Problem}}, booktitle = {31st International Symposium on Algorithms and Computation (ISAAC 2020)}, pages = {60:1--60:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-173-3}, ISSN = {1868-8969}, year = {2020}, volume = {181}, editor = {Cao, Yixin and Cheng, Siu-Wing and Li, Minming}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2020.60}, URN = {urn:nbn:de:0030-drops-134042}, doi = {10.4230/LIPIcs.ISAAC.2020.60}, annote = {Keywords: Computational geometry, online algorithms, range assignment, broadcast} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Joseph (Seffi) Naor, Seeun William Umboh, and David P. Williamson. Tight Bounds for Online Weighted Tree Augmentation. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 88:1-88:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{naor_et_al:LIPIcs.ICALP.2019.88, author = {Naor, Joseph (Seffi) and Umboh, Seeun William and Williamson, David P.}, title = {{Tight Bounds for Online Weighted Tree Augmentation}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {88:1--88:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.88}, URN = {urn:nbn:de:0030-drops-106647}, doi = {10.4230/LIPIcs.ICALP.2019.88}, annote = {Keywords: Online algorithms, competitive analysis, tree augmentation, network design} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Siddharth Barman, Shuchi Chawla, and Seeun Umboh. Network Design with Coverage Costs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 48-63, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@InProceedings{barman_et_al:LIPIcs.APPROX-RANDOM.2014.48, author = {Barman, Siddharth and Chawla, Shuchi and Umboh, Seeun}, title = {{Network Design with Coverage Costs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {48--63}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.48}, URN = {urn:nbn:de:0030-drops-46876}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.48}, annote = {Keywords: Network Design, Spanner, Primal Dual Method, Traffic Redundancy} }
Feedback for Dagstuhl Publishing