TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

K

Koch, Ronald and Nasrabadi, Ebrahim and Skutella, Martin.
Continuous and discrete flows over time.
Mathematical Methods of Operations Research, 2011. To appear.

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.


Koch, Ronald and Skutella, Martin.
Nash Equilibria and the Price of Anarchy for Flows Over Time.
Theory of Computing Systems, 49: 71–97, 2011.

Link zur Publikation

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.


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

Köhler, Ekkehard and Langkau, Katharina and Skutella, Martin.
Time-Expanded Graphs for Flow-Dependent Transit Times.
In Möhring, Rolf H. and Raman, Rajeev, eds. Algorithms – ESA '02, Lecture Notes in Computer Science, 2461: 599–611. Springer, 2002.

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

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

Köhler, Ekkehard and Skutella, Martin.
Flows over time with load-dependent transit times.
In Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms,  174–183. San Francisco, CA, 2002.


L

Landry, Chantal and Henrion, René and Hömberg, Dietmar and Skutella, Martin and Welz, Wolfgang.
Task assignment, sequencing and path-planning in robotic welding cells.
In Methods and Models in Automation and Robotics (MMAR), 2013 18th International Conference on,  252-257. , 2013.


M

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

Marchetti-Spaccamela, Alberto and Megow, Nicole and Schlöter, Jens and Skutella, Martin and Stougie, Leen.
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems.
In Proceedings of the 34th IEEE International Parallel and Distributed Processing Symposium, . , 2020.


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

Martens, Maren and Skutella, Martin.
Flows on Few Paths: Algorithms and Lower Bounds.
In Albers, Susanne and Radzik, Tomasz, eds. Algorithms – ESA '04, Lecture Notes in Computer Science, 3221: 520–531. Springer, 2004.


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