Hardness results and approximation algorithms for some problems on graphs
This thesis has two parts. In the first part, we study some graph covering problems with a non-local covering rule that allows a "remote" node to be covered by repeatedly applying the covering rule. In the second part, we provide some results on the packing of Steiner trees. In the Prop...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/4147 |