Study on Two Optimization Problems: Line Cover and Maximum Genus Embedding
In this thesis, we study two optimization problems which have a lot of important applications in diverse domains: Line Cover Problem (LCP) in Computational Geometry and Maximum Genus Embedding (MGE) in Topological Graph Theory. We study LCP whose decision version is known NP-Complete from the persp...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-11073 |