'Disjoint cycles' presentation slideshows

1.59k views • 147 slides

Data reduction lower bounds: Problems without polynomial kernels

Data reduction lower bounds: Problems without polynomial kernels. Hans L. Bodlaender Joint work with Downey, Fellows, Hermelin, Thomasse, Yeo. This talk. Kernelisation Distillation conjecture and problems without polynomial kernels Example: Long Path Composability

434 views • 33 slides

Chapter 6. Relaxation

Chapter 6. Relaxation. I. Superstring. restriction. f ( y *) = min f ( y ). f ( x *) = min f ( x ). y in ?. x in ?. ?. x *. y *. ?. y. Relaxation. x A. x *. ?. x*. Min f(x). x in ?. x A. f ( x* ) < opt = min f ( x ) < f ( x A ). x in ?.

354 views • 28 slides