Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
teaching:ws2021:seminar-schmidt [2020/07/01 12:35]
dschmidt
teaching:ws2021:seminar-schmidt [2020/10/21 16:14] (current)
dschmidt
Line 2: Line 2:
  
 ^When ^Where ^Start ^Lecturer^ ^When ^Where ^Start ^Lecturer^
-|Tuesday,  10:15-11:45  | Online / Zoom |  October 27th | [[staff:dschmidt|Schmidt]] |+|Tuesday,  10:15-11:45  | Online / Zoom |  November 3rd | [[staff:dschmidt|Schmidt]] | 
 + 
 +The seminar will cover research papers in Algorithmics with a focus on Network Design and Optimization under Uncertainty, i.e. the question of finding good solutions under incomplete information. Please find a list of example topics below. 
 + 
 +If you are interested in participating, please contact [[staff:dschmidt|Daniel Schmidt]] before <del>October 27th</del>**November 2nd**. Places will be assigned shortly after that date. 
 + 
 +Please see [[https://www.hrz.uni-bonn.de/en/services/internet-and-network-access/vpn|this website for instructions on how to connect to the university VPN]] and access literature remotely. 
 + 
 +=== Example Topics === 
 +  - Aissi, Bazgan, and Vanderpooten. Min–Max and Min–Max Regret Versions of Combinatorial Optimization Problems: A Survey. European J. of Operational Research 197(2), 2009. [[https://doi.org/10.1016/j.ejor.2008.09.012|(Link via Uni Bonn VPN)]]. 
 +  - Conde. On a Constant Factor Approximation for Minmax Regret Problems Using a Symmetry Point Scenario. European J. of Operational Research 219 (2), 2012. [[https://doi.org/10.1016/j.ejor.2012.01.005|(Link via Uni Bonn VPN)]]. 
 +  - Kasperski and Zieliński. On the Existence of an FPTAS for Minmax Regret Combinatorial Optimization Problems with Interval Data. Operations Research Letters 35(4), 2007. 
 +  - Gupta, Kumar, Pál, and Roughgarden. Approximation via Cost Sharing: Simpler and Better Approximation Algorithms for Network Design. J of the ACM 54(3). [[https://doi.org/10.1145/1236457.1236458|(Link via Uni Bonn VPN)]]. 
 +  - Fleischer, Könemann, Leonardi, and Schäfer. Simple Cost Sharing Schemes for Multicommodity Rent-or-Buy and Stochastic Steiner Tree. STOC 2006. [[https://doi.org/10.1145/1132516.1132609|(Link via Uni Bonn VPN)]]. 
 +  - Dhamdhere, Goyal, Ravi, Singh. How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. FOCS 2005. [[http://www.contrib.andrew.cmu.edu/~ravi/|(Preprint on author homepage)]]. 
 +  - Gupta, Nagarajan, and Vazirani. Thrifty Algorithms for Multistage Robust Optimization. IPCO 2005. [[https://doi.org/10.1007/11538462_8|(Link via Uni Bonn VPN)]] [[http://arxiv.org/abs/1302.5445/|(Full version on arXiv)]] 
 +  - Gupta, Pál, Ravi, and Sinha. What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX/RANDOM 2005 2015. [[https://doi.org/10.1007/11538462_8|(Link via Uni Bonn VPN)]] [[http://www.contrib.andrew.cmu.edu/~ravi/|(Full version via author homepage)]]. 
 +  - Gupta and Kumar. Greedy Algorithms for Steiner Forest. STOC 2015. [[https://doi.org/10.1145/2746539.2746590|(Link via Uni Bonn VPN)]]. 
 +  - Fiorini, Groß, Könemann, and Sanità. Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. SODA 2018. [[https://doi.org/10.1137/1.9781611975031.53|(Link via Uni Bonn VPN)]]. 
 +  - Könemann, Olver, Pashkovich, Ravi, Swamy, and Vygen. On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX/RANDOM 2017. [[https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.17|(Open Access Link)]]
  
-The seminar will cover research papers in Algorithmics. A more detailed list of topics will be announced in due time. Talks will be held digitally. 
  
-If you are interested in participating, please contact [[staff:dschmidt|Daniel Schmidt]] before October 27th. Places will be assigned shortly after that date. 
  

Page Tools