Approximating the sparsest $k$-subgraph in chordal graph

Rémi Watrigant; Marin Bougeret; Rodolphe Giroudeau

doi:10.1007/s00224-014-9568-2

Journal Articles Theory of Computing Systems Year : 2016

Approximating the sparsest $k$-subgraph in chordal graph

(1) , (2) , (1)

1
2

Rémi Watrigant

Function : Author
PersonId : 171721
IdHAL : remi-watrigant
ORCID : 0000-0002-6243-5910
IdRef : 199341230

Methods, Algorithms for Operations REsearch

Marin Bougeret

Function : Author
PersonId : 10167
IdHAL : marin-bougeret
ORCID : 0000-0002-9910-4656
IdRef : 197511686

Algorithmes, Graphes et Combinatoire

CV

Rodolphe Giroudeau

Function : Author
PersonId : 172373
IdHAL : rodolphe-giroudeau
IdRef : 095605355

Methods, Algorithms for Operations REsearch

CV

Keywords

Approximation algorithm Sparsest k-subgraph Chordal graphs

Domains

Operations Research [math.OC]

Rodolphe Giroudeau : Connect in order to contact the contributor

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

Submitted on : Tuesday, October 18, 2016-10:22:41 AM

Last modification on : Friday, March 24, 2023-2:53:03 PM

Dates and versions

lirmm-01383119 , version 1 (18-10-2016)

Identifiers

HAL Id : lirmm-01383119 , version 1
DOI : 10.1007/s00224-014-9568-2

Cite

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the sparsest $k$-subgraph in chordal graph. Theory of Computing Systems, 2016, 58 (1), pp.111-132. ⟨10.1007/s00224-014-9568-2⟩. ⟨lirmm-01383119⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS MAORE ALGCO LIRMM MIPS UNIV-MONTPELLIER

141 View

0 Download

Approximating the sparsest $k$-subgraph in chordal graph

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share