Skip to Main content Skip to Navigation
Conference papers

Approximating the Sparsest $k$-Subgraph in Chordal Graphs

Rémi Watrigant 1 Marin Bougeret 1 Rodolphe Giroudeau 1 
1 MAORE - Methods, Algorithms for Operations REsearch
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Document type :
Conference papers
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01283611
Contributor : Rodolphe Giroudeau Connect in order to contact the contributor
Submitted on : Saturday, March 5, 2016 - 6:19:37 PM
Last modification on : Friday, August 5, 2022 - 3:03:01 PM

Identifiers

Collections

Citation

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the Sparsest $k$-Subgraph in Chordal Graphs. WAOA: Workshop on Approximation and Online Algorithms, Sep 2013, Sophia Antipolis, France. pp.73-84, ⟨10.1007/978-3-319-08001-7_7⟩. ⟨lirmm-01283611⟩

Share

Metrics

Record views

100