final update

cs5330-randomizedteam · Apr 21, 2019 · 436b76e · 436b76e
1 parent b9cff21
commit 436b76e
Show file tree

Hide file tree

Showing 17 changed files with 751 additions and 0 deletions.
diff --git a/CS5330 Final Report/Sparsification_Final_Report.pdf b/CS5330 Final Report/Sparsification_Final_Report.pdf
diff --git a/CS5330 Final Report/images/all_weak_edge_example.png b/CS5330 Final Report/images/all_weak_edge_example.png
diff --git a/CS5330 Final Report/images/contract_strong.png b/CS5330 Final Report/images/contract_strong.png
diff --git a/CS5330 Final Report/images/decomposition.png b/CS5330 Final Report/images/decomposition.png
diff --git a/CS5330 Final Report/images/dense_sparse_graph.png b/CS5330 Final Report/images/dense_sparse_graph.png
diff --git a/CS5330 Final Report/images/mincut.png b/CS5330 Final Report/images/mincut.png
diff --git a/CS5330 Final Report/images/non_unifrom_graph.png b/CS5330 Final Report/images/non_unifrom_graph.png
diff --git a/CS5330 Final Report/images/redundant_edge.png b/CS5330 Final Report/images/redundant_edge.png
diff --git a/CS5330 Final Report/images/sample.png b/CS5330 Final Report/images/sample.png
diff --git a/CS5330 Final Report/images/separate_graph.png b/CS5330 Final Report/images/separate_graph.png
diff --git a/CS5330 Final Report/images/square_example.png b/CS5330 Final Report/images/square_example.png
diff --git a/CS5330 Final Report/images/standard_bigger_strong.png b/CS5330 Final Report/images/standard_bigger_strong.png
diff --git a/CS5330 Final Report/images/starClique.jpg b/CS5330 Final Report/images/starClique.jpg
diff --git a/CS5330 Final Report/images/strength.png b/CS5330 Final Report/images/strength.png
diff --git a/CS5330 Final Report/images/uni_graph.png b/CS5330 Final Report/images/uni_graph.png
diff --git a/CS5330 Final Report/main.tex b/CS5330 Final Report/main.tex
diff --git a/CS5330 Final Report/references.bib b/CS5330 Final Report/references.bib
@@ -0,0 +1,36 @@
+@article{benczur2015randomized,
+  title={Randomized approximation schemes for cuts and flows in capacitated graphs},
+  author={Bencz{\'u}r, Andr{\'a}s A and Karger, David R},
+  journal={SIAM Journal on Computing},
+  volume={44},
+  number={2},
+  pages={290--319},
+  year={2015},
+  publisher={SIAM}
+}
+
+@article{benczur207078randomized,
+  title={Randomized approximation schemes for cuts and flows in capacitated graphs, 2002},
+  author={Bencz{\'u}r, Andr{\'a}s A and Karger, David R},
+  journal={arXiv preprint cs/0207078}
+}
+
+@article{karger1999random,
+  title={Random sampling in cut, flow, and network design problems},
+  author={Karger, David R},
+  journal={Mathematics of Operations Research},
+  volume={24},
+  number={2},
+  pages={383--413},
+  year={1999},
+  publisher={INFORMS}
+}
+
+@article{nagamochi1992linear,
+  title={Linear time algorithms for finding k-edge connected and k-node connected spanning subgraphs},
+  author={Nagamochi, Hiroshi and Ibaraki, Toshihide},
+  journal={Algorithmica},
+  volume={7},
+  pages={583--596},
+  year={1992}
+}