Dominating Set By Eric Wengert.

Slides:



Advertisements
Similar presentations
Approximation algorithms for geometric intersection graphs.
Advertisements

Connectivity - Menger’s Theorem Graphs & Algorithms Lecture 3.
Approximation Algorithms
Design and Analysis of Algorithms Approximation algorithms for NP-complete problems Haidong Xue Summer 2012, at GSU.
Theory of Computing Lecture 18 MAS 714 Hartmut Klauck.
Vertex Cover Dominating Set These slides are based on the Lecture Notes by David Mount for the course CMSC 451 at the University of Maryland. The Copyright.
NP-Completeness: Reductions
Approximation Algorithms Chapter 5: k-center. Overview n Main issue: Parametric pruning –Technique for approximation algorithms n 2-approx. algorithm.
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems Feb Jerry Le
Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:
Section 4.2 Network Flows By Christina Touhey. The flow out of a equals the flow into z. Algorithm 1.Make vertex a: (0, ). 2.Scan the first vertex and.
Approximation Algorithms
Computability and Complexity 24-1 Computability and Complexity Andrei Bulatov Approximation.
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 24 Instructor: Paul Beame.
CSE 421 Algorithms Richard Anderson Lecture 27 NP Completeness.
Toward NP-Completeness: Introduction Almost all the algorithms we studies so far were bounded by some polynomial in the size of the input, so we call them.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.
What is the next line of the proof? a). Assume the theorem holds for all graphs with k edges. b). Let G be a graph with k edges. c). Assume the theorem.
Graph Coloring.
Homework solution Problem 2. The number of odd degree vertices in a graph is even. (recom. book: G. Harary: Graph Theory) Solution: Let G=(V,E,w) S= 
The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.
1 The TSP : NP-Completeness Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell.
APPROXIMATION ALGORITHMS VERTEX COVER – MAX CUT PROBLEMS
MCS 312: NP Completeness and Approximation algorithms Instructor Neelima Gupta
Lecture 22 More NPC problems
Prof. Swarat Chaudhuri COMP 482: Design and Analysis of Algorithms Spring 2012 Lecture 10.
Example Question on Linear Program, Dual and NP-Complete Proof COT5405 Spring 11.
NP-complete Problems SAT 3SAT Independent Set Hamiltonian Cycle
The Dominating Set and its Parametric Dual  the Dominated Set  Lan Lin prepared for theory group meeting on June 11, 2003.
WK15. Vertex Cover and Approximation Algorithm By Lin, Jr-Shiun Choi, Jae Sung.
1 Latency-Bounded Minimum Influential Node Selection in Social Networks Incheol Shin
Chapter 4 Partition (1) Shifting Ding-Zhu Du. Disk Covering Given a set of n points in the Euclidean plane, find the minimum number of unit disks to cover.
1 CPSC 320: Intermediate Algorithm Design and Analysis July 30, 2014.
Steiner Tree Problem Given: A set S of points in the plane = terminals
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness Proofs.
Introduction to NP Instructor: Neelima Gupta 1.
Instructor: Dr. GautamDas February 24, 2009 Class notes by Ranganath M R.
MCS 312: NP Completeness and Approximation Algorithms Instructor Neelima Gupta
COMPLEXITY. Satisfiability(SAT) problem Conjunctive normal form(CNF): Let S be a Boolean expression in CNF. That is, S is the product(and) of several.
The NP class. NP-completeness
More NP-Complete and NP-hard Problems
More NP-complete problems
P & NP.
Mathematical Foundations of AI
Richard Anderson Lectures NP-Completeness
Richard Anderson Lecture 26 NP-Completeness
Richard Anderson Lecture 26 NP-Completeness
Hamiltonian Cycle and TSP
Hamiltonian Cycle and TSP
NP-Completeness (36.4-5) P: yes and no in pt NP: yes in pt NPH  NPC
CS4234 Optimiz(s)ation Algorithms
CS154, Lecture 16: More NP-Complete Problems; PCPs
Parameterised Complexity
Homework solution Problem 2. The number of odd degree vertices in a graph is even. (recom. book: G. Harary: Graph Theory) Solution: Let G=(V,E,w) S=vVdeg(v)
Richard Anderson Lecture 25 NP-Completeness
Coping With NP-Completeness
Richard Anderson Lecture 28 NP-Completeness
Coverage Approximation Algorithms
Linear Programming Duality, Reductions, and Bipartite Matching
Problem Solving 4.
Graph Coloring.
NP-Completeness Yin Tat Lee
CS154, Lecture 16: More NP-Complete Problems; PCPs
Ch09 _2 Approximation algorithm
Coping With NP-Completeness
Instructor: Aaron Roth
Lecture 28 Approximation of Set Cover
Lecture 24 Vertex Cover and Hamiltonian Cycle
Presentation transcript:

Dominating Set By Eric Wengert

Dominating Set Set of vertices such that every vertex is either in set S or adjacent to a vertex in S

Dominating Set Set of vertices such that every vertex is either in set S or adjacent to a vertex in S Maximum Independent set is a dominating set

Minimal Dominating Set There exists no vertex w such that S−{w} is also a dominating set in G

Dominating Set Decision Problem Given a graph G and an integer k Does G have a dominating set of size at most k?

DS in NP For each vertex in graph G Success Check if vertex is in S or adjacent to a vertex in S If vertex not in S and not adjacent to S, reject Success Can be done in polynomial time Therefore dominating set is in NP

DS in NP-complete Vertex cover is NP-Complete Vertex cover to dominating set K for VC = 3 K for DS = 2 Change graph so k for DS = 3

DS in NP-complete Vertex cover to dominating set Add vertices and edges to make triangles Claim: 𝐺 ′ has a DS of size at most k iff G has a vertex cover of size at most k

DS in NP-complete Vertex cover to dominating set Add vertices and edges to make triangles Find degree of original nodes 6 2 4 4 4 4

DS in NP-complete Vertex cover to dominating set Add vertices and edges to make triangles Find degree of original nodes Greedy: choose vertex with highest degree 6 2 4 4 4 4

DS in NP-complete Vertex cover to dominating set Add vertices and edges to make triangles Find degree of original nodes Greedy: choose vertex with highest degree 6 2 4 4 4 4

DS in NP-complete Vertex cover to dominating set Add vertices and edges to make triangles Find degree of original nodes Greedy: choose vertex with highest degree One vertex left over so DS k = 3 6 2 4 4 4 4

Greedy Algorithm S = Ø While there are vertices not in or adjacent to S v = {v | w(v) = maxu {w(u)}} // w(v) is degree S = S U v ln(Δ) approximation // Δ is the maximal degree of G

References Proof https://www.youtube.com/watch?v=ba6HGbxSg1g https://math.stackexchange.com/questions/80721/vertex-cover-reduction https://stackoverflow.com/questions/5313919/proof-that-dominating-set-is-np-complete Algorithm https://disco.ethz.ch/courses/podc_allstars/lecture/chapter26.pdf