TU Berlin

Britta PeisPublications

Page Content

to Navigation

Publications

Matuschke, Jannik and McCormick, S. Thomas and Oriolo, Gianpaolo and Peis, Britta and Skutella, Martin.
Protection of flows under targeted attacks.
Operations Research Letters, Vol. 45, pp. 53-59, 2017.


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


Harks, Tobias and Klimm, Max and Peis, Britta.
Resource Competition on Integral Polymatroids.
In Proceedings of the 10th Conference on Web and Internet Economics (WINE), 2014. (to appear).


Fujishige, Satoru and Peis, Britta.
Lattice Polyhedra and Submodular Flows.
Japan Journal of Industrial and Applied Mathematics, Vol. 29, pp. 441-451, 2012.


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


Harks, Tobias and Peis, Britta.
Resource Buying Games.
In Leah Epstein and Paolo Ferragina (ed.)Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, Lecture Notes in Computer Science, Vol. 7501, pp. 563-574, Springer, 2012.


McCormick, S. Tom and Peis, Britta.
A Primal-Dual Algorithm for Weighted Abstract Cut Packing.
In Günlück, Oktay and Woeginger, Gerhard (ed.)Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, USA, Lecture Notes in Computer Science, Springer, Vol. 6655, pp. 324-335, 2011.


Wiese, Andreas and Peis, Britta.
Universal Packet Routing with Arbitrary Bandwidths and Transit Times.
In Günlück, Oktay and Woeginger, Gerhard (ed.)Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, USA, Lecture Notes in Computer Science, Springer, Vol. 6655, pp. 362–375, 2011.


Faigle, Ulrich and Kern, Walter and Peis, Britta.
On Greedy and Submodular Matrices.
In Marchetti-Spaccamela and Segal, Michael (ed.)Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, Lecture Notes in Computer Science, Springer, Vol. 6595, pp. 116-126, 2011.


Peis, Britta and Wiese, Andreas.
Universal packet routing with arbitrary bandwidths and transit times.
In Integer Programming and Combinatorial Optimization (IPCO 2011), pp. 362-375, Springer, 2011.


Peis, Britta and Wiese, Andreas.
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
In Approximation and Online Algorithms (WAOA 2010), pp. 213–224, Springer, 2011.


Bansal, Nikhil and Khandekar, Rohit and Könemann, Jochen and Nagarajan, Viswanath and Peis, Britta.
On Generalizations of Network Design Problems with Degree Bounds.
In Eisenbrand, Friedrich and Shepherd, F. Bruce (ed.)Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, Lecture Notes in Computer Science, Springer, Vol. 6080, pp. 110-123, 2010.


Peis, Britta and Skutella, Martin and Wiese, Andreas.
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
In Jansen, Klaus and Solis-Oba, Roberto (ed.)Approximation and Online Algorithms, 8th International Workshop, WAOA 2009, Lecture Notes in Computer Science, Springer, Vol. 6534, pp. 213-224, 2010.


Matuschke, Jannik and Peis, Britta.
Lattices and Maximum Flow Algorithms in Planar Graphs.
In Thilikos, Dimitrios (ed.)Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, Lecture Notes in Computer Science, Springer, Vol. 6410, pp. 324-335, 2010.

Link to original publication


Faigle, Ulrich and Peis, Britta.
Two-phase Greedy Algorithms for Some Classes of Combinatorial Linear Programs.
ACM Transactions on Algorithms, Vol. 6(4), 2010. An extended abstract appeared in SODA 2008-proceedings.


Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe