Sciweavers

2 search results - page 1 / 1
» Finding Short Integral Cycle Bases for Cyclic Timetabling
Sort
View
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 6 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov