Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

Editor: Skutella, M.
Home Policy Brochure Browse Search User Area Contact Help

Number of items: 3.


Manthey, B. and Waanders, M. (2016) Approximation Algorithms for k-Connected Graph Factors. In: Proceedings of the 13th Workshop on Approximation and Online Algorithms (WAOA 2015), 17-18 Dec 2015, Patras, Greece. pp. 1-12. Lecture Notes in Computer Science 9499. Springer Verlag. ISBN 978-3-319-28683-9


Müller, R. and Uetz, M.J. (2015) Shortest Path to Mechanism Design. In: Gems of Combinatorial Optimization and Graph Algorithms. Springer Verlag, Berlin, pp. 83-94. ISBN 978-3319249704


Brueggemann, T. and Hurink, J.L. and Vredeveld, T. and Woeginger, G.J. (2008) Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines. In: 5th International Workshop on Approximation and Online Algorithms, October 11-12, 2007, Eilat, Israel. pp. 41-54. Lecture Notes in Computer Science 4927. Springer Verlag. ISSN 0302-9743 ISBN 978-3-540-77917-9

This list was generated on Mon May 29 05:50:12 CEST 2017.