Approximating Maximum Subgraphs without Short Cycles

Guy Kortsarz, Michael Langberg, Zeev Nutov. Approximating Maximum Subgraphs without Short Cycles. In Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld, editors, Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings. Volume 5171 of Lecture Notes in Computer Science, pages 118-131, Springer, 2008. [doi]

Abstract

Abstract is missing.