Approximating Maximum Subgraphs without Short Cycles
From MaRDI portal
Publication:5894186
DOI10.1137/09074944XzbMath1214.05057MaRDI QIDQ5894186
Michael Langberg, Guy Kortsarz, Zeev Nutov
Publication date: 15 March 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Related Items (4)
Inapproximability of $H$-Transversal/Packing ⋮ Packing and Covering a Given Directed Graph in a Directed Graph ⋮ Kernelization for cycle transversal problems ⋮ Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
This page was built for publication: Approximating Maximum Subgraphs without Short Cycles