60 https://www.uni-bremen.de/en/cslog-1/emmy/explorable-uncertainty 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 Sat, 04 Apr 2026 15:13:07 +0200 Sat, 04 Apr 2026 15:13:07 +0200 University of Bremen content-452559 Fri, 06 Mar 2026 09:57:17 +0100 https://www.uni-bremen.de/en/cslog-1/emmy/stochastic-optimization Stochastic Optimization Content content-452555 Fri, 06 Mar 2026 09:57:17 +0100 https://www.uni-bremen.de/en/cslog-1/emmy/explorable-uncertainty#c452555 <p><strong>Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty </strong><a href="https://arxiv.org/pdf/2206.15201.pdf" target="_blank" title="Opens external link in new window">arxiv.org</a><br /> Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter<br /> ESA 2022</p> <p><strong>Explorable Uncertainty Meets Decision-Making in Logistics </strong><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> <br /> Nicole Megow and Jens Schlöter<br /> Dynamics in Logistics: 35-56, 2021  <a href="https://www.springerprofessional.de/dynamics-in-logistics/19925238" target="_blank" title="Öffnet externen Link in neuem Fenster">springer.com </a></p> <p><strong>Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty </strong> <a href="https://arxiv.org/pdf/2107.00572.pdf" target="_blank" title="Öffnet externen Link in neuem Fenster">pdf</a><br /> Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo S. de Lima, Nicole Megow, Jens Schlöter<br /> Accepted for publication at ESA 2021</p> <p><strong>Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments</strong><br /> Jacob Focke, Nicole Megow, Julie Meißner<br /> ACM Journal of Experimental Algorithmics 25(1), Article 1.14, 2020</p> <p><strong>An Adversarial Model for Scheduling with Testing</strong><br /> Christoph Dürr, Thomas Erlebach, Nicole Megow and Julie Meißner<br /> Algorithmica 82(12): 3630-3675, 2020</p> <p><strong>Scheduling with Explorable Uncertainty  </strong><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>  <a href="https://link.springer.com/chapter/10.1007%2F978-3-319-94418-0_16" target="_blank">springer.com</a><br /> C. Dürr, T. Erlebach, J. Meißner and N. Megow.<br /> In Proc. of the 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 30:1-30:14, 2018.</p> <p><strong>Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments  </strong><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><br /> J. Focke, J. Meißner, N. Megow<br /> In Proc. of the 16th International Symposium on Experimental Algorithms (SEA 2017), LIPIcs, Article No. 22; pp. 22:1–22:14, 2017.</p> <p><strong>Randomization Helps Computing a Minimum Spanning Tree under Uncertainty</strong>  <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><br /> J. Meißner, N. Megow, M. Skutella<br /> SIAM Journal on Computing 46(4): 1217-1240, 2017.</p> <p><strong>Randomization Helps Computing a Minimum Spanning Tree under Uncertainty  </strong><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><br /> J. Meißner, N. Megow and M. Skutella<br /> In Proc. of the 23rd European Symposium on Algorithms (ESA 2015), LNCS 9294, pp. 878-890, Springer, 2015.</p> Content