Approximating Maximum Subgraphs without Short Cycles

DOI10.1007/978-3-540-85363-3_10zbMath1159.68668OpenAlexW1881449478MaRDI QIDQ5900473

Guy Kortsarz, Michael Langberg, Zeev Nutov

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_10

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

On the small cycle transversal of planar graphs ⋮ On the Small Cycle Transversal of Planar Graphs ⋮ New kernels for several problems on planar graphs ⋮ On Generating Triangle-Free Graphs

This page was built for publication: Approximating Maximum Subgraphs without Short Cycles