Dr. Martin Groß

  Photo of Dr. Martin Groß Copyright: © Private



whit S. Fiorini, J. Könemann and L. Sanità
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (2018).
whit A. Gupta, A. Kumar, J. Matuschke, D. R. Schmidt, M. Schmidt and J. Verschae
A Local-Search Algorithm for Steiner Forest
Leibniz International Proceedings in Informatics (LIPIcs) 94, pp. 31:1-31:17 (2018).
whit A. Arulselvan, Á. Cseh, D. Manlove and J. Matuschke
Matchings with Lower Quotas: Algorithms and Complexity
Algorithmica 80 (1), pp. 185-208 (2018).
whit M. Pfetsch and M. Skutella
On the Complexity of Instationary Gas Flows
Accepted for publication in Operation Reseach Letters.

whit A. Bernstein and Y. Disser
General Bounds for Incremental Maximization
Leibniz International Proceedings in Informatics (LIPIcs) 80, pp. 43:1-43:14 (2017).

whit F. Abed, L. Chen, Y. Disser, N. Megow, J. Meißner, A. T. Richter and R. Rischke
Scheduling maintenance jobs in networks
Algorithms and Complexity, pp.19-30 (2017).

whit A. Arulselwan and M. Skutella
Graph orientation and flows over time
Networks 66 (3), pp. 196-209 (2015).

whit M. Skutella
A tight bound on the speed-up through storage for quickest multi-commodity flows
Operations Research Letters 43 (1), pp. 93-95 (2015).

whit P. Domschke, F. M. Hante, B. Hiller, L. Schewe and M. Schmidt
Mathematische Modellierung, Simulation und Optimierung von Gastransportnetzwerken
Tech Report (2015).
whit M. Skutella
Maximum Multicommodity Flows over Time without Intermediate Storage
Algorithms - ESA, pp. 539-550 (2012).
whit J.-P. W. Kappmeier, D. R. Schmidt and M. Schmidt
Approximating Earliest Arrival Flows in Arbitrary Networks
Algorithms - ESA, pp. 551-562 (2012).
whit M. Skutella
Generalized Maximum Flows over Time
Approximation and Online Algorithms, pp. 247-260 (2011).
whit D. Dressler, J.-P. W. Kappmeier, T. Kelter, J. Kulbatzki, D. Plümpe, G. Schlechter, M. Schmidt, M. Skutella and S. Temme
On the use of network flow techniques for assigning evacuees to exits
Procedia Engineering 3, pp. 205-215 (2010).

whit M. Pfetsch, L. Schewe, M. Schmidt and M. Skutella
Algorithmic results for potential-based flows: Easy and hard cases
Tech Report (2017).

with R. Burlacu, H. Egger, A. Martin, M. Pfetsch, L. Schewe, A. Sirvent and M. Skutella
A global Optimization Approach for Instationary Gas Transport in Pipeline Networks
Tech Report (2017).

Approximation algorithms for comples network flow over time problems

Flows over time with commodity-dependent transit times