Artikel dengan mandat akses publik - Max KlimmPelajari lebih lanjut
Tidak tersedia di mana pun: 2
Parametric computation of minimum-cost flows with piecewise quadratic costs
M Klimm, P Warode
Mathematics of Operations Research 47 (1), 812-846, 2022
Mandat: German Research Foundation
Equilibria in multiclass and multidimensional atomic congestion games
M Klimm, A Schütz
Mathematics of Operations Research 47 (4), 2743-2764, 2022
Mandat: German Research Foundation
Tersedia di suatu tempat: 41
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
T Harks, M Klimm
Mathematics of Operations Research 37 (3), 419-436, 2012
Mandat: German Research Foundation
Characterizing the Existence of Potential Functions in Weighted Congestion Games
T Harks, M Klimm, RH Möhring
Theory of Computing Systems 49 (1), 46-70, 2011
Mandat: German Research Foundation
Conflict-free vehicle routing: Load balancing and deadlock prevention
E Gawrilow, M Klimm, RH Möhring, B Stenzel
EURO Journal on transportation and logistics 1 (1-2), 87-111, 2012
Mandat: German Research Foundation
Computing network tolls with support constraints
T Harks, I Kleinert, M Klimm, RH Möhring
Networks 65 (3), 262-285, 2015
Mandat: German Research Foundation
On the existence of pure Nash equilibria in weighted congestion games
T Harks, M Klimm
International Colloquium on Automata, Languages, and Programming, 79-89, 2010
Mandat: German Research Foundation
Strong equilibria in games with the lexicographical improvement property
T Harks, M Klimm, RH Möhring
International Journal of Game Theory 42, 461-482, 2013
Mandat: German Research Foundation
Packing a knapsack of unknown capacity
Y Disser, M Klimm, N Megow, S Stiller
SIAM Journal on Discrete Mathematics 31 (3), 1477-1497, 2017
Mandat: German Research Foundation
Undirected Graph Exploration with ⊝(log log n) Pebbles
Y Disser, J Hackfeld, M Klimm
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
Mandat: German Research Foundation
Approximate Pure Nash Equilibria in Weighted Congestion Games
C Hansknecht, M Klimm, A Skopalik
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2014
Mandat: German Research Foundation
Complexity and approximation of the continuous network design problem
M Gairing, T Harks, M Klimm
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013
Mandat: UK Engineering and Physical Sciences Research Council
Congestion games with player-specific costs revisited
M Gairing, M Klimm
International Symposium on Algorithmic Game Theory, 98-109, 2013
Mandat: German Research Foundation, UK Engineering and Physical Sciences Research …
Improving the H k-Bound on the Price of Stability in Undirected Shapley Network Design Games
Y Disser, AE Feldmann, M Klimm, M Mihalák
Algorithms and Complexity, 158-169, 2013
Mandat: Swiss National Science Foundation
Congestion Games with Variable Demands
T Harks, M Klimm
Mathematics of Operations Research 41 (1), 255-277, 2016
Mandat: German Research Foundation, European Commission
Resource competition on integral polymatroids
T Harks, M Klimm, B Peis
Web and Internet Economics: 10th International Conference, WINE 2014 …, 2014
Mandat: European Commission
Sensitivity analysis for convex separable optimization over integral polymatroids
T Harks, M Klimm, B Peis
SIAM Journal on Optimization 28 (3), 2222-2245, 2018
Mandat: German Research Foundation
Greedy metric minimum online matchings with random arrivals
M Gairing, M Klimm
Operations Research Letters 47 (2), 88-91, 2019
Mandat: UK Engineering and Physical Sciences Research Council
Distance-preserving graph contractions
A Bernstein, K Däubel, Y Disser, M Klimm, T Mütze, F Smolny
SIAM journal on discrete mathematics 33 (3), 1607-1636, 2019
Mandat: German Research Foundation
The online best reply algorithm for resource allocation problems
M Klimm, D Schmand, A Tönnis
International Symposium on Algorithmic Game Theory, 200-215, 2019
Mandat: European Commission
Informasi terbitan dan pendanaan ditentukan secara otomatis oleh program komputer