direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications

Koch, Ronald and Peis, Britta and Skutella, Martin and Wiese, Andreas.
Real-Time Message Routing and Scheduling.
In Jansen, Klaus and Naor, Joseph and Rolim, Jose (ed.)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX-RANDOM 2009, Berkeley, USA, Lecture Notes in Computer Science, Springer, Vol. 5687, pp. 217–230, 2009.


Peis, Britta and Skutella, Martin and Wiese, Andreas.
Packet Routing: Complexity and Algorithms.
In Bampis, Evripidis and Jansen, Klaus (ed.)Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 2009. Revised Papers, pp. 217–228, Springer, 2010.

Link to publication


Skutella, Martin and Peis, Britta and Wiese, Andreas.
Packet Routing on the Grid.
In Lopez-Ortiz, Alejandro (ed.)Theoretical Informatics, 9th Latin American Symposium, LATIn 2010, Oaxaca, Mexico, Lecture Notes in Computer Science, Springer, Vol. 6034, pp. 120-130, 2010.


Peis, Britta and Stiller, Sebastian and Wiese, Andreas.
Policies for Periodic Packet Routing.
In Cheong, Otfried and Chwa Kyung-Yong and Park, Kunsoo (ed.)Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, Lecture Notes in Computer Science, Springer, Vol. 6507, pp. 266–278, 2010.


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.


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.


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


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.


Faigle, Ulrich and Kern, Walter and Peis, Britta.
A Ranking Model for Cooperative Games, Convexity and the Greedy Algorithm.
Math. Programming, (doi:10.1007/s10107-010-0406-2), Vol. A, 2010.


Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.