Minimum Crossing Problems on Graphs
This thesis will address several problems in discrete optimization. These problems are considered hard to solve. However, good approximation algorithms for these problems may be helpful in approximating problems in computational biology and computer science. Given an undirected graph G=(V,E) and a...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/2658 |