Seminar: Ausgewählte Themen aus Effiziente Algorithmen
- Dozent: Prof. Dr. Susanne Albers
- Modul: IN2107, IN8901, TUMonline
-
Bereich:
2 SWS Seminar im Bereich Informatik III (Theoretische Informatik) -
Zeit und Ort:
Donnerstag,16:00–18:00, 03.11.018
Inhalt
Dieses Seminar richtet sich an Studierende im Masterstudiengang Informatik, die Interesse an der Entwicklung und Analyse von Algorithmen haben. Die Seminarteilnehmer arbeiten ausgewählte Literatur auf. Die vorgestellten Arbeiten behandeln ein Spektrum von Themen und kommen unter anderem aus den Bereichen (a) algorithmische Geometrie, (b) Graphenalgorithmen und (c) algorithmische Spieltheorie.
Seminarthemen
-
Computational Geometry: Convex Hulls
M. de Berg, O. Cheong, M. van Kreveld and M. Overmars. Computational Geometry: Algorithms and Applications. 3rd Edition, Springer, 2008. Chapters 1 and 11, pp. 1-10 and 243-249.
- Computational Geometry: Line Segment Intersection
M. de Berg, O. Cheong, M. van Kreveld and M. Overmars. Computational Geometry: Algorithms and Applications. 3rd Edition, Springer, 2008. Chapter 2, pp. 19-29.
- Computational Geometry: Point Location
M. de Berg, O. Cheong, M. van Kreveld and M. Overmars. Computational Geometry: Algorithms and Applications. 3rd Edition, Springer, 2008. Chapter 6, pp. 121-137.
- Computational Geometry: Voronoi Diagrams
M. de Berg, O. Cheong, M. van Kreveld and M. Overmars. Computational Geometry: Algorithms and Applications. 3rd Edition, Springer, 2008. Chapter 7, pp. 147-159.
- Online Matching in Bipartite Graphs
R.M. Karp, U.V. Vazirani and V.V. Vazirani. An optimal algorithm for online bipartite matching. Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), 352-358, 1990.
B.E. Birnbaum and C. Kenyon. Online bipartite matching made simple. SIGACT News, 39(1):80-87, 2008.
N.R. Devanur, K. Jain and R.D. Kleinberg. Randomized primal-dual analysis of Ranking for online bipartite matching. Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 101-107, 2013.
- Adwords: Online Matching in Advertising
A. Mehta, A. Saberi, U. Vazirani and V. Vazirani. AdWords and generalized online matching. Journal of the ACM, 54(5):22, 2007.
- Online Matching with Augmentations
K. Chaudhuri, C. Daskalakis, R.D. Kleinberg and H. Lin. Online bipartite perfect matching with augmentations. Proc. 28th IEEE International Conference on Computer Communications (INFOCOM), 1044-1052, 2009.
- Opinion Formation in Social Networks
F. Chierichetti, J. Kleinberg and A. Panconesi. How to schedule cascades in an arbitrary graph. SIAM Journal on Computing, 43(6):1602-1623, 2008.
- Network Design: Fair Cost Allocation
E. Anshlevich, A. Dasgupta, J.M. Kleinberg, E. Tardos and T. Wexler. The price of stability in network design with fair cost allocation. SIAM Journal on Computing, 38(4):1906-1920, 2014.
- Network Design: Arbitrary Payments
E. Anshlevich, A. Dasgupta, E. Tardos and T. Wexler. Near optimal network design with selfish agents. Theory of Computing, 4(1):77-109, 2008.
- Network Creation Games
A. Fabrikant, A. Luthra, E.N. Maneva, C.H. Papadimitriou and S. Shenker. On a network creation game. Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC), 347-351, 2003.
N. Alon, E.D. Demaine, M.T. Hajiaghayi and T. Leighton Basic network creation games. SIAM Journal on Discrete Mathematics, 27(2):656-668, 2013.