direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications

2008

Neumann, Frank and Reichel, Joachim and Skutella, Martin.
Computing Minimum Cuts by Randomized Search Heuristics.
In Proceedings of the 10th Genetic and Evolutionary Computation Conference,  779–787. , 2008.


Skutella, Katharina and Skutella, Martin.
Minimal aufspannende Bäume – Wenn das Naheliegende das Beste ist....
In Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Karl Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea, eds. Taschenbuch der Algorithmen,  353–360. Springer, 2008. In German.

Link to publication

2007

Eisenbrand, Friedrich and Grandoni, Fabrizio and Oriolo, Gianpaolo and Skutella, Martin.
New Approaches for Virtual Private Network Design.
SIAM Journal on Computing, 37: 706–721, 2007.

Link to publication

Fleischer, Lisa and Skutella, Martin.
Quickest Flows Over Time.
SIAM Journal on Computing, 36: 1600–1630, 2007.

Link to publication

Hall, Alex and Hippler, Steffen and Skutella, Martin.
Multicommodity Flows Over Time: Efficient Algorithms and Complexity.
Theoretical Computer Science, 379: 387–404, 2007.

Link to publication

Hall, Alex and Langkau, Katharina and Skutella, Martin.
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
Algorithmica, 47: 299–321, 2007.

Link to publication

Martens, Maren and Salazar, Fernanda and Skutella, Martin.
Convex Combinations of Single Source Unsplittable Flows.
In Arge, Lars and Welzl, Emo, eds. Algorithms – ESA '07, Lecture Notes in Computer Science, 4698: 395–406. Springer, 2007.

Link to publication

Reichel, Joachim and Skutella, Martin.
Evolutionary Algorithms and Matroid Optimization Problems.
In Proceedings of the 9th Genetic and Evolutionary Computation Conference,  947–954. , 2007.


2006

Arkin, Esther M. and Bender, Michael A. and Fekete, Sándor P. and Mitchell, Joseph S. B. and Skutella, Martin.
The freeze-tag problem: How to wake up a swarm of robots.
Algorithmica, 46: 193-221, 2006.

Link to publication

Baier, Georg and Erlebach, Thomas and Hall, Alex and Köhler, Ekkehard and Schilling, Heiko and Skutella, Martin.
Length-Bounded Cuts and Flows.
In Bugliesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo, eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 4051: 679–690. Springer, 2006.


Baumann, Nadine and Skutella, Martin.
Solving Evacuation Problems Efficiently: Earliest Arrival Flows with Multiple Sources.
In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science,  399–408. Berkeley, CA, 2006.


Becchetti, Luca and Korteweg, Peter and Marchetti-Spaccamela, Alberto and Skutella, Martin and Stougie, Leen and Vitaletti, Andrea.
Latency Constrained Aggregation in Sensor Networks.
In Azar, Yossi and Erlebach, Thomas, eds. Algorithms – ESA '06, Lecture Notes in Computer Science, 4168: 88–99. Springer, 2006.


Eisenbrand, Friedrich and Karrenbauer, Andreas and Skutella, Martin and Xu, Chihao.
Multiline Addressing by Network Flow.
In Azar, Yossi and Erlebach, Thomas, eds. Algorithms – ESA '06, Lecture Notes in Computer Science, 4168: 744–755. Springer, 2006.


Koch, Ronald and Skutella, Martin and Spenke, Ines.
Approximation and Complexity of k-Splittable Flows.
In Erlebach, Thomas and Persiano, Giuseppe, eds. Proceedings of the Third International Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, 3879: 244–257. Springer, 2006.


Martens, Maren and Skutella, Martin.
Length-Bounded and Dynamic k-Splittable Flows.
In Haasis, Hans-Dietrich and Kopfer, Herbert and Schönberger, Jörn, eds. Operations Research Proceedings 2005,  297–302. Springer, 2006.

Link to publication

Martens, Maren and Skutella, Martin.
Flows on Few Paths: Algorithms and Lower Bounds.
Networks, 48: 68–76, 2006.

Link to publication

Skutella, Martin.
List Scheduling in Order of α-Points on a Single Machine.
In Bampis, Evripidis and Jansen, Klaus and Kenyon, Claire, eds. Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications, Lecture Notes in Computer Science, 3484: 250–291. Springer, 2006.

Link to publication

2005

Althaus, Ernst and Funke, Stefan and Har-Peled, Sariel and Könemann, Jochen and Ramos, Edgar A. and Skutella, Martin.
Approximating k-Hop Minimum-Spanning Trees.
Operations Research Letters, 33: 115–120, 2005.

Link to publication

Baier, Georg and Köhler, Ekkehard and Skutella, Martin.
On the k-splittable flow problem.
Algorithmica, 42: 231–248, 2005.

Link to publication

Eisenbrand, Friedrich and Grandoni, Fabrizio and Oriolo, Gianpaolo and Skutella, Martin.
New Approaches for Virtual Private Network Design.
In Caires, Luís and Italiano, Giuseppe F. and Monteiro, Lu'\is and Palamidessi, Catuscia and Yung, Moti, eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 3580: 1151–1162. Springer, 2005.


Copyright notice

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

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.