TU Berlin

Jan-Philipp KappmeierPublications

COGA 5-Wheel

Page Content

to Navigation

Publications

Kappmeier, Jan-Philipp W. and Matuschke, Jannik and Peis, Britta.
Abstract flows over time: A first step towards solving dynamic packing problems.
Theoretical Computer Science, Vol. 544, pp. 74-85, 2014.

Link to publication Link to original publication


Kappmeier, Jan-Philipp W. and Matuschke, Jannik and Peis, Britta.
Abstract flows over time: A first step towards solving dynamic packing problems.
In Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee (ed.)Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, Lecture Notes in Computer Science, pp. 433-443, Springer, 2012.

Link to publication Link to original publication


Groß, Martin and Kappmeier, Jan-Philipp W. and Schmidt, Melanie and Schmidt, Daniel.
Approximating Earliest Arrival Flows in Arbitrary Networks.
In Epstein, Leah and Ferragina, Paolo (ed.)Algorithms – ESA 2012, pp. 551-562, Springer Berlin / Heidelberg, 2012.

Link to original publication


Dressler, Daniel and Groß, Martin and Kappmeier, Jan-Philipp and Kelter, Timon and Kulbatzki, Joscha and Plümpe, Daniel and Schlechter, Gordon and Schmidt, Melanie and Skutella, Martin and Temme, Sylvie.
On the use of network flow techniques for assigning evacuees to exits.
In Hoogendoorn, S.P. and Pel, A.J. and Taylor, M.A.P. and Mahmassani, H. (ed.)Proceedings of the International Conference on Evacuation Modeling and Management, Procedia Engineering, Vol. 3, pp. 205–215, Elsevier Ltd, 2010.

Link to original publication


Groß, Martin and Kappmeier, Jan-Philipp and Plümpe, Daniel and Schmidt, Melanie.
Kreuzzahlrätsel.
Mitteilungen der DMV, Vol. 18, pp. 118, 2010.


Groß, Martin and Kappmeier, Jan-Philipp and Plümpe, Daniel and Schmidt, Melanie.
Kreuzzahlrätsel.
Mitteilungen der DMV, Vol. 17, pp. 96, 2009.


Kappmeier, Jan-Philipp.
Berechnung maximaler Flüsse unter Vermeidung von Residualnetzwerken.
Diploma thesis, TU Dortmund, 2009. In German.

Link to publication


Preprints

Abstract flows over time: A first step towards solving dynamic packing problems
Citation key Report-001-2012
Author Kappmeier, Jan-Philipp W. and Matuschke, Jannik and Peis, Britta
Year 2012
Number 001
Institution Technische Universität Berlin, Institut für Mathematik
Abstract Abstract flows generalize classical network flows by replacing the under- lying network by an abstract system of "paths" fulfilling a simple switching property: Whenever two paths P and Q intersect, there must be another path that is contained in the beginning of P and the end of Q. Flows over time generalize classical network flows by introducing a notion of time. Travelling times specify how long flow takes to traverse an edge and at each point in time the capacity of all edges must be respected. For both versions, max flow/min cut theorems have been established and efficient algorithms for computing maximum flows are known. We show that those results still hold when combining the two concepts. In particular, we show that a maximum abstract flow over time can be obtained by solving a weighted abstract flow problem and constructing a temporally repeated flow from its solution. In the course of the proof, we also show that the relatively modest switching property of abstract networks already captures many essential properties of classical networks.
Bibtex Type of Publication Preprint
Link to publication Download Bibtex entry

Talks

2013
Delegation Visit of the Beijing University of Technology
Technische Universität Berlin, Germany, 31.10.2013
Evacuation Optimization (download)
COGA Doktoranden- & Diplomanden-Seminar
Technische Universität Berlin, Germany, 21.02.2013
How to TikZ?
Lehrstuhl-2-Seminar
Technische Universität Dortmund, Germany, 29.01.2013
Generalizations of Flows over Time and a Fake Application 




2012
International Symposium on Algorithms and Computation
National Taiwan University, 台北市 Taipei, 20.12.2012
Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems
Berlin-Poznań-Seminar
Freie Universität Berlin, Germany, 10.11.2012
Abstract Flows over Time
International Symposium on Mathematical Programming
Technische Universität Berlin, Germany, 23.08.2012
Flows over Time with Negative Transit Times and Arc Release Dates

International Conference on Evacuation Modeling and Management
Northwestern University, Evanston, USA, 15.08.2012
Evacuation of a 22-Story Building in Simulation and Reality
Cologne Twente Workshop on Graphs and combinatorial Optimization
Universität der Bundeswehr, Munich, Germany, 30.05.2012
Talk on Network Flows over Time with Negative Transit Times and Arc Release Dates.
Tools Seminar
Technische Universität Berlin, Germany, 09.02.2012
How to TikZ?




2010
COGA Doktoranden- & Diplomanden-Seminar
Technische Universität Berlin, Germany, 07.12.2010
How to TikZ? (updated version of 13.12.2010)




2009
International Conference on Evacuation Management 2009
Scheveningen, Netherlands, 24.09.2009
On the Use Network Flow Techniques for Assigning Evacuees to Exits




Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe