Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Klimm, Max"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improving the
H_k
-bound on the price of stability in undirected Shapley network design games
Yann Disser
,
Andreas Emil Feldmann
,
Max Klimm
,
Matús̑ Mihalák
Theoretical Computer Science
562
, 2014, pp. 557-564
Packing a knapsack of unknown capacity
Yann Disser
,
Max Klimm
,
Nicole Megow
,
Sebastian Stiller
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 276-287
Improving the
H_k
-bound on the price of stability in undirected shapley network design games
Yann Disser
,
Andreas Emil Feldmann
,
Max Klimm
,
Matús̑ Mihalák
Lecture Notes in Computer Science
7878
, 2013, pp. 158-169
Optimal file distribution in peer-to-peer networks
Kai-Simon Goetzmann
,
Tobias Harks
,
Max Klimm
,
Konstantin Miller
Lecture Notes in Computer Science
7074
, 2011, pp. 210-219
Characterizing the existence of potential functions in weighted congestion games
Tobias Harks
,
Max Klimm
,
Rolf H. Möhring
Theory of Computing Systems
49
(1), 2011, pp. 46-70
Computing pure Nash and strong equilibria in bottleneck congestion games
Tobias Harks
,
Martin Hoefer
,
Max Klimm
,
Alexander Skopalik
Lecture Notes in Computer Science
6347
, 2010, pp. 29-38
On the existence of pure Nash equilibria in weighted congestion games
Tobias Harks
,
Max Klimm
Lecture Notes in Computer Science
6198
, 2010, pp. 79-89