BE Comp Syllabus
BE_Comp_Syllabus_2008_pattern_pucomp
20080316 efficientalgorithms kulikov_lecture17
Approximation Algorithm: Iterative Rounding Lecture 15: March 9.
Fixed parameter tractability and kernelization for the Maximum Leaf Weight Spanning Tree problem
Bart Jansen
Bart Jansen 1. Problem definition Instance: Connected graph G, positive integer k Question: Is there a spanning tree for G with at least k leaves?
Parameterized Complexity Hans Bodlaender IPA Basiscursus Algoritmiek.
An introduction to Approximation Algorithms Presented By Iman Sadeghi.
