Yang, Lin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2009. / Includes bibliographical references (leaves 57-61). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Problems and Main Results --- p.2 / Chapter 1.1.1 --- Firefighting on Trees --- p.2 / Chapter 1.1.2 --- Maximum k-Vertex Cover on Trees --- p.3 / Chapter 1.2 --- Background --- p.3 / Chapter 1.2.1 --- Random Separation --- p.4 / Chapter 1.2.2 --- Kernelization --- p.5 / Chapter 1.2.3 --- Infeasibility of Polynomial Kernel --- p.6 / Chapter 1.3 --- Organization of the Thesis --- p.7 / Chapter 2 --- Firefighting on Trees --- p.9 / Chapter 2.1 --- Definitions and Notation --- p.10 / Chapter 2.2 --- FPT Algorithms --- p.13 / Chapter 2.2.1 --- Saving k Vertices --- p.14 / Chapter 2.2.2 --- Saving k Leaves --- p.19 / Chapter 2.2.3 --- Protecting k Vertices --- p.23 / Chapter 2.3 --- Approximation --- p.29 / Chapter 2.3.1 --- A (1 ´ؤ 1/e)-Approximation Algorithm --- p.29 / Chapter 2.3.2 --- LP-Repsecting Rounding cannot Do Better --- p.33 / Chapter 3 --- Maximum k-Vertex Cover on Trees --- p.38 / Chapter 3.1 --- Maximum k Vertex Cover on Trees --- p.39 / Chapter 3.2 --- k-MVC on Degree Bounded Graphs --- p.45 / Chapter 3.3 --- k-MVC on Degeneracy Bounded Graphs --- p.46 / Chapter 3.4 --- Extension to Maximum k Dominating Set --- p.47 / Chapter 4 --- Conclusion --- p.49 / Chapter 4.1 --- The Firefighter problem --- p.49 / Chapter 4.2 --- The Maximum k-Vertex Cover problem --- p.53 / Acknowledgement --- p.55 / Bibliography --- p.57
Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_326839 |
Date | January 2009 |
Contributors | Yang, Lin., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering. |
Source Sets | The Chinese University of Hong Kong |
Language | English, Chinese |
Detected Language | English |
Type | Text, bibliography |
Format | print, iv, 61 leaves : ill. ; 30 cm. |
Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0017 seconds