Geodesic
An approximation algorithm for the total covering problem
Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 3, pp. 553-558

Voir la notice de l'article provenant de la source Library of Science

We introduce a 2-factor approximation algorithm for the minimum total covering number problem.
Keywords: covering, total covering, approximation algorithm 
@article{DMGT_2007_27_3_a11,
     author = {Hatami, Pooya},
     title = {An approximation algorithm for the total covering problem},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {553--558},
     publisher = {mathdoc},
     volume = {27},
     number = {3},
     year = {2007},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2007_27_3_a11/}
}
TY  - JOUR
AU  - Hatami, Pooya
TI  - An approximation algorithm for the total covering problem
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2007
SP  - 553
EP  - 558
VL  - 27
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2007_27_3_a11/
LA  - en
ID  - DMGT_2007_27_3_a11
ER  - 
%0 Journal Article
%A Hatami, Pooya
%T An approximation algorithm for the total covering problem
%J Discussiones Mathematicae. Graph Theory
%D 2007
%P 553-558
%V 27
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2007_27_3_a11/
%G en
%F DMGT_2007_27_3_a11
Hatami, Pooya. An approximation algorithm for the total covering problem. Discussiones Mathematicae. Graph Theory, Tome 27 (2007) no. 3, pp. 553-558. http://geodesic.mathdoc.fr/item/DMGT_2007_27_3_a11/