approximating minimum cost steiner forests lecturer: moran feldman instructor: prof. zeev nutov
DESCRIPTION
3 (Undirected) Steiner Tree (ST) Instance: A graph G = (V,E), a cost function c: E +, and a set D V. Objective: Find a subgraph H G of minimum cost connecting all nodes of D. Terminology: The nodes of D are called terminals, the other nodes are called Steiner nodes. Application Example Connecting all components in an printed circuit using minimum cost silverTRANSCRIPT
![Page 1: Approximating Minimum Cost Steiner Forests Lecturer: Moran Feldman Instructor: Prof. Zeev Nutov](https://reader033.vdocuments.site/reader033/viewer/2022052706/5a4d1ae87f8b9ab059979db4/html5/thumbnails/1.jpg)
Approximating Minimum Cost Steiner Forests
Lecturer: Moran FeldmanInstructor: Prof. Zeev Nutov
![Page 2: Approximating Minimum Cost Steiner Forests Lecturer: Moran Feldman Instructor: Prof. Zeev Nutov](https://reader033.vdocuments.site/reader033/viewer/2022052706/5a4d1ae87f8b9ab059979db4/html5/thumbnails/2.jpg)
2
Talk Outline
• Presenting the problems• Previous results• Greedy algorithm for Covering Problems• Previous algorithm for DSF• Our algorithms for k-DSF and DSF• Summary