Martin Groß
Martin Groß
Verified email at - Homepage
Cited by
Cited by
On the use of network flow techniques for assigning evacuees to exits
D Dressler, M Groß, JP Kappmeier, T Kelter, J Kulbatzki, D Plümpe, ...
Procedia Engineering 3, 205-215, 2010
Generalized maximum flows over time
M Groß, M Skutella
International Workshop on Approximation and Online Algorithms, 247-260, 2011
On the cost of essentially fair clusterings
IO Bercea, M Groß, S Khuller, A Kumar, C Rösner, DR Schmidt, ...
arXiv preprint arXiv:1811.10319, 2018
Algorithmic results for potential‐based flows: Easy and hard cases
M Groß, ME Pfetsch, L Schewe, M Schmidt, M Skutella
Networks 73 (3), 306-324, 2019
Approximating earliest arrival flows in arbitrary networks
M Groß, JPW Kappmeier, DR Schmidt, M Schmidt
European Symposium on Algorithms, 551-562, 2012
Approximating weighted tree augmentation via chvátal-gomory cuts
S Fiorini, M Groß, J Könemann, L Sanità
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Matchings with lower quotas: algorithms and complexity
A Arulselvan, Á Cseh, M Groß, DF Manlove, J Matuschke
Algorithmica 80 (1), 185-208, 2018
Maximum multicommodity flows over time without intermediate storage
M Groß, M Skutella
European Symposium on Algorithms, 539-550, 2012
A 3 2-approximation algorithm for tree augmentation via chvátal-gomory cuts
S Fiorini, M Groß, J Könemann, L Sanitá
15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 77, 2017
Maximizing the storage capacity of gas networks: a global MINLP approach
R Burlacu, H Egger, M Groß, A Martin, ME Pfetsch, L Schewe, M Sirvent, ...
Optimization and Engineering 20 (2), 543-573, 2019
Approximation Algorithms for Complex Network Flow Over Time Problems
M Groß
Scheduling maintenance jobs in networks
F Abed, L Chen, Y Disser, M Groß, N Megow, J Meißner, AT Richter, ...
Theoretical Computer Science 754, 107-121, 2019
A local-search algorithm for Steiner forest
M Groß, A Gupta, A Kumar, J Matuschke, DR Schmidt, M Schmidt, ...
arXiv preprint arXiv:1707.02753, 2017
A global optimization approach for instationary gas transport in pipeline networks
R Burlacu, H Egger, M Groß, A Martin, M Pfetsch, L Schewe, M Sirvent, ...
General bounds for incremental maximization
A Bernstein, Y Disser, M Groß, S Himburg
Mathematical Programming, 1-27, 2020
Graph orientation and flows over time
A Arulselvan, M Groß, M Skutella
Networks 66 (3), 196-209, 2015
A tight bound on the speed-up through storage for quickest multi-commodity flows
M Groß, M Skutella
Operations Research Letters 43 (1), 93-95, 2015
Flows over time with commodity-dependent transit times
M Groß
Diplomarbeit (= Master's Thesis), TU Dortmund, 2009
On the complexity of instationary gas flows
M Groß, ME Pfetsch, M Skutella
Operations Research Letters 46 (3), 286-290, 2018
A Local-Search Algorithm for Steiner Forest
J Matuschke, M Groß, A Gupta, A Kumar, DR Schmidt, M Schmidt, ...
Leibniz International Proceedings in Informatics, 31: 1-31: 17, 2018
The system can't perform the operation now. Try again later.
Articles 1–20