University of Bremen - Online Algorithms

60 University of Bremen - Online Algorithms https://www.uni-bremen.de/en/cslog-1/emmy/online-algorithms This is the homepage of the working group CSLog - "Informatikmethoden zur adaptiven Steuerung in Logistik und Produktion" lead by Prof. Dr. Nicole Negow. en University of Bremen Sun, 05 Apr 2026 13:12:52 +0200 Sun, 05 Apr 2026 13:12:52 +0200 University of Bremen content-452519 Fri, 06 Mar 2026 09:57:11 +0100 Publications on Online Algorithms https://www.uni-bremen.de/en/cslog-1/emmy/online-algorithms#c452519 Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty&nbsp;<a href="https://arxiv.org/pdf/2206.15201.pdf" target="_blank" title="Opens external link in new window">arxiv.org</a> Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter ESA 2022 Non-clairvoyant Scheduling with Predictions Revisited&nbsp; <a href="https://arxiv.org/pdf/2202.10199.pdf" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a> Alexander Lindermayr and Nicole Megow SPAA 2022 Online load balancing with general reassignment cost&nbsp;<a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/Online_load_balancing_with_general_reassignment_cost.pdf" target="_blank" title="Initiates file download">pdf</a>&nbsp; <a href="https://www.sciencedirect.com/science/article/pii/S0167637722000487?utm_campaign=STMJ_AUTH_SERV_PUBLISHED&amp;utm_medium=email&amp;utm_acid=195417535&amp;SIS_ID=&amp;dgcid=STMJ_AUTH_SERV_PUBLISHED&amp;CMX_ID=&amp;utm_in=DM245737&amp;utm_source=AC_" target="_blank" title="Opens external link in new window">sciencedirect.com</a> Sebastian Berndt, Franziska Eberle, Nicole Megow Operations Research Letters 50(3): 322-328, 2022 Robustification of Online Graph Exploration Methods&nbsp; <a href="https://arxiv.org/pdf/2112.05422.pdf" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a> Franziska Eberle, Alexander Lindermayr, Nicole Megow, Lukas Nölke, Jens Schlöter AAAI 2022 Double Coverage with Machine-Learned Advice&nbsp; <a href="https://arxiv.org/abs/2103.01640#" target="_blank" title="Öffnet externen Link in neuem Fenster">arxiv.org</a>&nbsp; Alexander Lindermayr, Nicole Megow, Bertrand Simon&nbsp; ITCS 2022 Explorable Uncertainty Meets Decision-Making in Logistics&nbsp;<a href="https://www.springerprofessional.de/explorable-uncertainty-meets-decision-making-in-logistics/19925260" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a>&nbsp; Nicole Megow and Jens Schlöter Dynamics in Logistics: 35-56, 2021&nbsp;&nbsp;<a href="https://www.springerprofessional.de/dynamics-in-logistics/19925238" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com&nbsp;</a> Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty&nbsp;&nbsp;<a href="https://arxiv.org/pdf/2107.00572.pdf" target="_blank" title="Öffnet externen Link in neuem Fenster">pdf</a> Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter Accepted for publication at ESA 2021 Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments Jacob Focke, Nicole Megow, Julie Meißner ACM Journal of Experimental Algorithmics 25(1), Article 1.14, 2020 An Adversarial Model for Scheduling with Testing Christoph Dürr, Thomas Erlebach, Nicole Megow and&nbsp;Julie Meißner Algorithmica 82(12): 3630-3675, 2020 Online Minimum Cost Matching with Recourse on the Line&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/noelke/LIPIcs-APPROX37.pdf" target="_blank" title="pdf">PDF</a> N. Megow and L. Nölke. In Proc. of the&nbsp;23rd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 37:1-37:16 (APPROX 2020) Optimally Handling Commitment Issues in Online Throughput Maximization&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/feberle/EberleMS_ESA2020.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">pdf</a>&nbsp; <a href="https://doi.org/10.4230/LIPIcs.ESA.2020.41" target="_blank" title="Öffnet externen Link in neuem Tab">dagstuhl.de</a> F. Eberle, N. Megow, and K. Schewior. Proceedings of ESA 2020, pp. 41:1-41:15, 2020. A General Framework for Handling Commitment in Online Throughput Maximization&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/feberle/pub/ChenEMSS_MathProg2020.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">pdf</a>&nbsp; <a href="https://doi.org/10.1007/s10107-020-01469-2" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com</a> L. Chen, F. Eberle, N. Megow, K. Schewior, and C. Stein. Mathematical Programming 183(1): 215-247, 2020 A General Framework for Handling Commitment in Online Throughput Maximization&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/feberle/ChenEMSS_IPCO2019.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">pdf</a>&nbsp; <a href="https://doi.org/10.1007/978-3-030-17953-3_11" target="_blank">springer.com</a> L. Chen, F. Eberle, N. Megow, K. Schewior, C. Stein. Proceedings of IPCO 2019, pp. 141-154, 2019. Scheduling with Explorable Uncertainty&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/DuerrEMM-ITCS2018.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>&nbsp; <a href="https://link.springer.com/chapter/10.1007%2F978-3-319-94418-0_16" target="_blank">springer.com</a> C. Dürr, T. Erlebach, J. Meißner and N. Megow. In Proc. of the 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 30:1-30:14, 2018. An O(log m)-Competitive Algorithm for Online Machine Minimization&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/ChenMS-SICOMP2018.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a>&nbsp; <a href="https://epubs.siam.org/doi/10.1137/17M116032X" target="_blank">siam.org</a> L. Chen, N. Megow, K. Schewior SIAM Journal on Computing 47(6), 2057–2077, 2018. Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/mstexplore-SEA2017.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> J. Focke, J. Meißner, N. Megow In Proc. of the 16th International Symposium on Experimental Algorithms (SEA 2017), LIPIcs, Article No. 22; pp. 22:1–22:14, 2017. Randomization Helps Computing a Minimum Spanning Tree under Uncertainty&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/MegowMS-SICOMP2017.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> J. Meißner, N. Megow, M. Skutella SIAM Journal on Computing 46(4): 1217-1240, 2017. Packing a Knapsack of Unknown Capacity&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/DisserKMS-SIDMA2017.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> Y. Disser, M. Klimm, N. Megow, S. Stiller SIAM Journal on Discrete Mathematics 31(3): 1477-1497, 2017. Universal Sequencing on an Unreliable Machine N. Megow, Julian Mestre Encyclopedia of Algorithms 2016: 2304-2308. The Power of Migration in Online Machine Minimization&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/chenMS-SPAA2016.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> L. Chen, N Megow and K. Schewior In Proc. of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), pp. 175-184, 2016. An O(log m)-Competitive Algorithm for Online Machine Minimization&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/ChenMS-SODA16.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> L. Chen, N. Megow and K. Schewior In Proc. of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 155-163, 2016. A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio E. Lübbecke, O. Maurer, N. Megow, A. Wiese ACM Transactions on Algorithms 13(1), pp. 15:1-15:34, 2016. The Power of Recourse for Online MST and TSP&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/RecourseMST-SICOMP16.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> N. Megow, M. Skutella, J. Verschae, A. Wiese SIAM Journal on Computing. 45-3, pp. 859-880, 2016 Universal Sequencing on an Unreliable Machine N. Megow, Julian Mestre Encyclopedia of Algorithms 2016: 2304-2308. Randomization Helps Computing a Minimum Spanning Tree under Uncertainty&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/MegowMeissnerSkutella2015.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> J. Meißner, N. Megow and M. Skutella In Proc. of the 23rd European Symposium on Algorithms (ESA 2015), LNCS 9294, pp. 878-890, Springer, 2015. Packing a Knapsack of Unknown Capacity&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/knapsack-STACS2014.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> Y. Disser, M. Klimm, N. Megow, S. Stiller In Proc. of the 31st Symposium on Theoretical Aspects of Computer Science (STACS 2015), pp. 276-287, 2015 Polynomial-time exact schedulability tests for harmonic real-time tasks&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/BonifaciMarchettiMegow_2013.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> V. Bonifaci, A Marchetti-Spaccamela, N. Megow, A. Wiese In Proc. of the 34th IEEE Real-Time Systems Symposium (RTSS 2013), pp. 236-245, 2013. Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/itcs13-instance-sensitive.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> N. Megow, J. Mestre In Proc. of the 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), pp. 495-504, 2013. A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/GuentherMaurerMegowEtal2013.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> E. Günther, O. Maurer, N. Megow, A. Wiese In Proc. of the 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 118-128, 2013. The Power of Recourse for Online MST and TSP N. Megow, M. Skutella, J. Verschae, A. Wiese In Proc. of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), LNCS 7391, pages 689-700, Springer, 2012. Algorithms and Complexity for Periodic Real-Time Scheduling&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/bonifaciCMM-TALG-2012.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> V. Bonifaci, H.-L. Chan, A. Marchetti-Spaccamela ACM Transactions on Algorithms, Vol. 9, pp. 601-619, 2012. Online graph exploration: New results on old and new algorithms&nbsp; <a href="https://www.uni-bremen.de/fileadmin/user_upload/fachbereiche/fb3/infcon/CSLog/Publications/nmegow/MegowMehlhornSchweitzer2012.pdf" target="_blank" title="Leitet Herunterladen der Datei ein">PDF</a> K. Mehlhorn, N. Megow, P. Schweitzer Theoretical Computer Science, Vol. 463, pp. 62-72, 2012. Special Issue on Theory and Applications of Graph Searching Problems. Content