Exact and approximation algorithms for some packing and covering problems in graphs - Archive ouverte HAL Access content directly
Habilitation À Diriger Des Recherches Year : 2017

Exact and approximation algorithms for some packing and covering problems in graphs

Cédric Bentz
Fichier principal
Vignette du fichier
hdr_CB.pdf (1.03 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

tel-03078788 , version 1 (16-12-2020)

Identifiers

  • HAL Id : tel-03078788 , version 1

Cite

Cédric Bentz. Exact and approximation algorithms for some packing and covering problems in graphs. Computer Science [cs]. Sorbonne Université, UPMC, 2017. ⟨tel-03078788⟩
147 View
105 Download

Share

Gmail Facebook X LinkedIn More