Approximation Algorithms for Covering Problems in Dense Graphs
We present a set of approximation results for several covering problems in dense graphs. These results show that for several problems, classical algorithms with constant approximation ratios can be analyzed in a finer way, and provide better constant approximation ratios under some density constrain...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Universite Libre de Bruxelles
2009
|
| Subjects: | |
| Online Access: | http://theses.ulb.ac.be/ETD-db/collection/available/ULBetd-01262009-174908/ |