|
Approximability of Cycle Covers and Smoothed Analysis of Binary Search Trees (2008) |
- Bodo Manthey,
- Zur Erlangung Der,
- Bodo Manthey,
- Berichterstatter Prof,
- Dr. Rüdiger Reischuk,
- Prof Dr,
- Kurt Mehlhorn,
- Prof Dr,
- Heribert Vollmer,
- Vorsitz Prüfungsausschusses,
- Prof Dr,
- Walter Dosch
|
Abstract |
|
the years. I also thank the current and former members of the Institut für Theoretische Informatik at the Universität zu Lübeck for many valuable discussions, not only about computer science. In particular, I am indebted to Markus Bläser from whom I learned a lot about approximation algorithms. Special thanks go to Jan Arpe for patiently listening to all my ideas and mistakes and to him and Martin Böhme for carefully proofreading this thesis. Finally, I thank my wife Sandra for her encouragement and my son Falk; a couple of thoughts evolved while I was taking him for a walk in his pram. v ACKNOWLEDGEMENTS vi CONTENTS |
Details der Publikation |
| Download |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.8651 |
| Quelle |
http://www-cc.cs.uni-sb.de/manthey/publications/Dissertation_Manthey.pdf |
| Mitarbeiter |
CiteSeerX
|
| Archiv |
CiteSeerX - Scientific Literature Digital Library and Search Engine (United States) |
| Keywords |
1.1 Restricted Cycle Covers....................... 1
|
| Typ |
text
|
| Sprache |
Englisch
|
| Verknüpfungen |
10.1.1.10.1514,
10.1.1.10.6159,
10.1.1.9.6346,
10.1.1.86.6310,
10.1.1.89.5990,
10.1.1.86.8453,
10.1.1.6.3643,
10.1.1.100.6829,
10.1.1.104.1445,
10.1.1.88.776,
10.1.1.86.718,
10.1.1.88.4690
|
|