TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

2008

Koch, Ronald and Skutella, Martin and Spenke, Ines.
Maximum k-Splittable s,t-Flows.
Theory of Computing Systems, 43: 56–66, 2008.

Link zur Publikation

Martens, Maren and Skutella, Martin.
A Network Flow Problem with Unit Path Capacities and Related Packing and Covering Problems.
In Yang, Boting and Du, Ding-Zhu and Wang, Cao An, eds. Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, 5165:  180–189. Springer, 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 zur Publikation

2009

Baumann, Nadine and Skutella, Martin.
Solving Evacuation Problems Efficiently: Earliest Arrival Flows with Multiple Sources.
Mathematics of Operations Research, 34: 499–512, 2009.

Link zur Publikation

Becchetti, Luca and Korteweg, Peter and Marchetti-Spaccamela, Alberto and Skutella, Martin and Stougie, Leen and Vitaletti, Andrea.
Latency Constrained Aggregation in Sensor Networks.
ACM Transactions on Algorithms, 6: 13:1–13:20, 2009.

Link zur Publikation

Correa, José R. and Skutella, Martin and Verschae, José.
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.
In Dinur, Irit and Jansen, Klaus and Naor, Joseph and Rolim, José D. P., eds. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, Lecture Notes in Computer Science, 5687:  84–97. Springer, 2009.

Link zur Publikation

Eisenbrand, Friedrich and Karrenbauer, Andreas and Skutella, Martin and Xu, Chihao.
Multiline Addressing by Network Flow.
Algorithmica, 53: 583–596, 2009.

Link zur Publikation

Köhler, Ekkehard and Möhring, Rolf H. and Skutella, Martin.
Traffic networks and flows over time.
In Lerner, Jürgen and Wagner, Dorothea and Zweig, Katharina A., eds. Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation, Lecture Notes in Computer Science, 5515: 166–196. Springer, 2009.

Link zur Publikation

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, eds. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX-RANDOM 2009, Berkeley, USA, Lecture Notes in Computer Science, Springer, 5687:  217–230. , 2009.


Koch, Ronald and Skutella, Martin.
Nash Equilibria and the Price of Anarchy for Flows Over Time.
In Mavronicolas, Marios and Papadopoulou, Vicky G., eds. Proceedings of the 2nd International Symposium on Algorithmic Game Theory, Lecture Notes in Computer Science, 5814: 323–334. Springer, 2009.


Martens, Maren and Skutella, Martin.
A Network Flow Problem with Unit Path Capacities and Related Packing and Covering Problems.
Journal of Combinatorial Optimization, 18: 272–293, 2009.

Link zur Publikation

Reichel, Joachim and Skutella, Martin.
On the size of weights in randomized search heuristics.
In Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms,  21–28. New YorkACM, 2009.

Link zur Publikation

Salazar, Fernanda and Skutella, Martin.
Single-source k-splittable min-cost flows.
Operations Research Letters, 37: 71–74, 2009.

Link zur Publikation

Sanders, Peter and Sivadasan, Naveen and Skutella, Martin.
Online Scheduling with Bounded Migration.
Mathematics of Operations Research, 34: 481–498, 2009.

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