TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

N

Neumann, Frank and Reichel, Joachim and Skutella, Martin.
Computing Minimum Cuts by Randomized Search Heuristics.
Algorithmica, 59: 323–342, 2011.

Link zur Publikation

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.


P

Peis, Britta and Skutella, Martin and Wiese, Andreas.
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
In Jansen, Klaus and Solis-Oba, Roberto, eds. Approximation and Online Algorithms, 8th International Workshop, WAOA 2009, Lecture Notes in Computer Science, Springer, 6534:  213-224. , 2010.


Peis, Britta and Skutella, Martin and Wiese, Andreas.
Packet Routing: Complexity and Algorithms.
In Bampis, Evripidis and Jansen, Klaus, eds. Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, Lecture Notes in Computer Science, Springer, 5893:  217–228. , 2010.


Peis, Britta and Skutella, Martin and Wiese, Andreas.
Packet Routing: Complexity and Algorithms.
In Bampis, Evripidis and Jansen, Klaus, eds. Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 2009. Revised Papers, Lecture Notes in Computer Science, 5893: 217–228. Springer, 2010.

Link zur Publikation

R

Reichel, Joachim and Skutella, Martin.
Evolutionary Algorithms and Matroid Optimization Problems.
Algorithmica, 57: 187–206, 2010.

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

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


S

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.
In Diaz, Josep and Karhumäki, Juhani and Lepistö, Arto and Sannella, Donald, eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 3142: 1111–1122. Springer, 2004.


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

Link zur Publikation

Schlöter, Miriam and Skutella, Martin.
Fast and Memory-Efficient Algorithms for Evacuation Problems.
In Klein, Philip N., eds. Proceedings of the 28th Annual ACM–SIAM Symposium on Discrete Algorithms,  821-840. SIAM, 2017.


Schmidt, Melanie and Skutella, Martin.
Earliest Arrival Flows in Networks with Multiple Sinks.
Discrete Applied Mathematics, 164: 320-327, 2014.


Schmidt, Melanie and Skutella, Martin.
Earliest arrival flows in networks with multiple sinks.
Discrete Applied Mathematics, 2011. http://www.sciencedirect.com/science/article/pii/S0166218X11003593.

Link zur Publikation Link zur Originalpublikation

Schmidt, Melanie and Skutella, Martin.
Earliest Arrival Flows in Networks with Multiple Sinks.
Electronic Notes in Discrete Mathematics, 36: 607–614, 2010. ISCO 2010 – International Symposium on Combinatorial Optimization.

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