Αλγόριθμοι Δικτύων και Πολυπλοκότητα Παρουσιάσεις 2013 18/6 ===== 1) Α. Νικολιδάκη "Steiner Tree Approximation via Iterative Randomized Rounding" των J. Byrka, F. Grandoni, T. Rothvoss, L. Sanita. 2) Κ. Μάστακας E. M. Arkin, R. Hassin, and A. Levin. Approximations for minimum and min-max vehicle routing problems. Journal of Algorithms, 59(1):1-18, 2006. & V. Nagarajan and R. Ravi. Approximation algorithms for distance constrained vehicle routing problems. Networks, 59(2):209-214, 2012. 28/6 ===== 10:00-11:15 ------------------ 3) Ι. Μυτιλήνης Tight Bounds for Parallel Randomized Load Balancing 4) Σ. Μανιάτης Ryan Williams. Finding a path of length k in O*(2k) time 5) Α. Γιαννακοπουλος Optimal Hierarchical Decompositions for Congestion Minimization in Networks 11:30-13:10 ------------------ 6) Χ. Τζοβάς Compact Routing Schemes 7) Π. Καλογερόπουλος Improving Christofides' Algorithm for the s-t Path TSP 8) Ι. Νέμπαρης Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring 9) Δ. Μπάκας Approximation Schemes for Multi-Budgeted Independence Systems 10) Γ. Ζηρδέλης Constrained Matching Problems in Bipartite Graphs 13:30-14:45 ----------------- 11) Δ. Χατζηδημητρίου An Efficient Algorithm for the “Optimal” Stable Marriage 12) Ν. Παπαηλιού Approximation Algorithms for Conflict-Free Vehicle Routing, Kaspar Schupbach and Rico Zenklusen 13) Ε. Ζυγομήτρος A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility