direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments



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


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

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

Link zur Publikation

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.

Köhler, Ekkehard and Skutella, Martin.
Flows over time with load-dependent transit times.
SIAM Journal on Optimization, 15: 1185–1202, 2005.

Link zur Publikation

Katriel, Irit and Kutz, Martin and Skutella, Martin.
Reachability Substitutes for Planar Digraphs.
, 2005.

Link zur Publikation

Magnanti, Thomas L. and Sivaraman, Raghavendran and Skutella, Martin.
Linear Programming, Quickest Flows, and Time Cost Trade-offs.
In Proceedings of the 2nd International Network Optimization Conference, . , 2005.

Link zur Publikation

Skutella, Martin and Uetz, Marc.
Stochastic machine scheduling with precedence constraints.
SIAM Journal on Computing, 34: 788–802, 2005.

Link zur Publikation


Goemans, Michel X. and Skutella, Martin.
Cooperative facility location games.
Journal of Algorithms, 50: 194–214, 2004.

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.

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe

Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.