Hitting Diamonds and Growing Cacti

DOI10.1007/978-3-642-13036-6_15zbMath1284.05282arXiv0911.4366OpenAlexW1591716186MaRDI QIDQ3569818

Ugo Pietropaoli, Samuel Fiorini, Gwenaël Joret

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0911.4366

Mathematics Subject Classification ID

Integer programming (90C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (9)

Hitting Weighted Even Cycles in Planar Graphs ⋮ An improved deterministic parameterized algorithm for cactus vertex deletion ⋮ Towards constant-factor approximation for chordal/distance-hereditary vertex deletion ⋮ Quick but odd growth of cacti ⋮ Small minors in dense graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Hitting Forbidden Minors: Approximation and Kernelization

This page was built for publication: Hitting Diamonds and Growing Cacti