Approximating the Sparsest $k$-Subgraph in Chordal Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Conference Papers Year : 2014

Approximating the Sparsest $k$-Subgraph in Chordal Graphs

Rémi Watrigant
Methods, Algorithms for Operations REsearch
Marin Bougeret
Methods, Algorithms for Operations REsearch
CV
Rodolphe Giroudeau
Methods, Algorithms for Operations REsearch
CV

Domains

Computational Complexity [cs.CC]

Rodolphe Giroudeau  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01283611

Submitted on : Saturday, March 5, 2016-6:19:37 PM

Last modification on : Saturday, July 15, 2023-4:09:56 AM

No file

Dates and versions

lirmm-01283611 , version 1 (05-03-2016)

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS MAORE LIRMM MIPS UNIV-MONTPELLIER
116 View
0 Download

Altmetric

Share

More