Approximation algorithms for covering problems in dense graphs

Approximation algorithms for covering problems in dense graphs

Show other versions (1)

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...

Full description

Bibliographic Details
Main Author: Levy, Eythan
Other Authors: Cardinal, Jean
Format: Doctoral Thesis
Language:fr
Published: Universite Libre de Bruxelles 2009
Subjects:
Informatique générale
Sciences exactes et naturelles
Computer algorithms
Approximation theory > Data processing
Graph theory > Data processing
Algorithmes
Théorie de l'approximation > Informatique
Théorie des graphes > Informatique
Approximation algorithm
vertex cover
edge dominating set
minimum maximal matching
connected vertex cover
dense graph
Online Access:http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210359

Internet

http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210359

Similar Items