Approximating the Sparsest k-Subgraph in Chordal Graphs

Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau. Approximating the Sparsest k-Subgraph in Chordal Graphs. Theory Comput. Syst., 58(1):111-132, 2016. [doi]

@article{WatrigantBG16,
  title = {Approximating the Sparsest k-Subgraph in Chordal Graphs},
  author = {Rémi Watrigant and Marin Bougeret and Rodolphe Giroudeau},
  year = {2016},
  doi = {10.1007/s00224-014-9568-2},
  url = {http://dx.doi.org/10.1007/s00224-014-9568-2},
  researchr = {https://researchr.org/publication/WatrigantBG16},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {58},
  number = {1},
  pages = {111-132},
}