Approximating Minimum Cost Steiner Forests Lecturer: Moran Feldman Instructor: Prof. Zeev Nutov.

Post on 08-Jan-2018

222 views 0 download

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 silver

Transcript of Approximating Minimum Cost Steiner Forests Lecturer: Moran Feldman Instructor: Prof. Zeev Nutov.

Approximating Minimum Cost Steiner Forests

Lecturer: Moran FeldmanInstructor: Prof. Zeev Nutov

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