intro done

ref.bib

@@ -168,3 +168,18 @@ keywords = {sparsest cut, hardness of approximation, Directed multicut}
 	keywords = {Approximation algorithms, Computer science, Costs, Linear programming, Mathematics},
 	pages = {144--153},
 }
+
+@inproceedings{chlamtac_approximating_2010,
+	address = {Berlin, Heidelberg},
+	title = {Approximating {Sparsest} {Cut} in {Graphs} of {Bounded} {Treewidth}},
+	isbn = {978-3-642-15369-3},
+	doi = {10.1007/978-3-642-15369-3_10},
+	language = {en},
+	booktitle = {Approximation, {Randomization}, and {Combinatorial} {Optimization}. {Algorithms} and {Techniques}},
+	publisher = {Springer},
+	author = {Chlamtac, Eden and Krauthgamer, Robert and Raghavendra, Prasad},
+	editor = {Serna, Maria and Shaltiel, Ronen and Jansen, Klaus and Rolim, José},
+	year = {2010},
+	keywords = {General Demand, Linear Programming Relaxation, Linear Programming Solution, Tree Decomposition, Vertex Cover},
+	pages = {124--137},
+}