TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

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 zur Publikation

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

Link zur Publikation

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 zur Publikation

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 zur Publikation

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

Link zur Publikation

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

Link zur Publikation

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 zur Publikation

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 zur Publikation

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


2008

Biermann, Dirk and Surmann, Tobias and Sacharow, Alexei and Skutella, Martin and Theile, Madeleine.
Automated analysis of the form error caused by springback in metal sheet forming.
In Bouzakis, Konstantinos-Dionysios, eds. Proceedings of the 3rd International Conference on Manufacturing Engineering, 1.-3. October 2008, Kallithea of Chalkidiki, Greece,  737–746. , 2008.

Link zur Publikation

Grandoni, Fabrizio and Kaibel, Volker and Oriolo, Gianpaolo and Skutella, Martin.
A short proof of the VPN tree routing conjecture on ring networks.
Operations Research Letters, 36: 361–365, 2008.

Link zur Publikation

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.

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe