Lecture 2-4 More examples

Slides:



Advertisements
Similar presentations
Theory of Computing Lecture 18 MAS 714 Hartmut Klauck.
Advertisements

What is Intractable? Some problems seem too hard to solve efficiently. Question 1: Does an efficient algorithm exist?  An O(a ) algorithm, where a > 1,
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.
1 NP-completeness Lecture 2: Jan P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many.
NP-Completeness: Reductions
The Theory of NP-Completeness
Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems Feb Jerry Le
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
1 Approximation Algorithms CSC401 – Analysis of Algorithms Lecture Notes 18 Approximation Algorithms Objectives: Typical NP-complete problems Approximation.
Transitivity of  poly Theorem: Let ,  ’, and  ’’ be three decision problems such that   poly  ’ and  ’  poly  ’’. Then  poly  ’’. Proof:
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
Last class Decision/Optimization 3-SAT  Independent-Set Independent-Set  3-SAT P, NP Cook’s Theorem NP-hard, NP-complete 3-SAT  Clique, Subset-Sum,
Clique Cover Cook’s Theorem 3SAT and Independent Set
Lecture 8-9 More examples
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.
1 The Theory of NP-Completeness 2 NP P NPC NP: Non-deterministic Polynomial P: Polynomial NPC: Non-deterministic Polynomial Complete P=NP? X = P.
The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.
The Theory of NP-Completeness 1. What is NP-completeness? Consider the circuit satisfiability problem Difficult to answer the decision problem in polynomial.
1 The Theory of NP-Completeness 2012/11/6 P: the class of problems which can be solved by a deterministic polynomial algorithm. NP : the class of decision.
Lecture 22 More NPC problems
Polynomial-time reductions We have seen several reductions:
CSE 024: Design & Analysis of Algorithms Chapter 9: NP Completeness Sedgewick Chp:40 David Luebke’s Course Notes / University of Virginia, Computer Science.
1 How to prove that a problem is NPC. 2 Cook Cook showed the first NPC problem: SAT Cook received Turing Award in 1982.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness and course wrap up.
Lecture 6 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.
Non-Approximability Results. Summary -Gap technique -Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING -The PCP theorem -Application:
Instructor Neelima Gupta Table of Contents Class NP Class NPC Approximation Algorithms.
EMIS 8373: Integer Programming Combinatorial Relaxations and Duals Updated 8 February 2005.
1.1 Chapter 3: Proving NP-completeness Results Six Basic NP-Complete Problems Some Techniques for Proving NP-Completeness Some Suggested Exercises.
Lecture 25 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.
28.
CSE 6311 – Spring 2009 ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS Lecture Notes – Feb. 3, 2009 Instructor: Dr. Gautam Das notes by Walter Wilson.
NP Completeness Piyush Kumar. Today Reductions Proving Lower Bounds revisited Decision and Optimization Problems SAT and 3-SAT P Vs NP Dealing with NP-Complete.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness Proofs.
The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.
CSE 421 Algorithms Richard Anderson Lecture 28 Survey of NP Complete Problems NP-Complete P.
1 The Theory of NP-Completeness 2 Review: Finding lower bound by problem transformation Problem X reduces to problem Y (X  Y ) iff X can be solved by.
ICS 353: Design and Analysis of Algorithms NP-Complete Problems King Fahd University of Petroleum & Minerals Information & Computer Science Department.
The Theory of NP-Completeness
More NP-complete problems
Richard Anderson Lectures NP-Completeness
Richard Anderson Lecture 26 NP-Completeness
Lecture 2-2 NP Class.
Richard Anderson Lecture 26 NP-Completeness
Hard Problems Introduction to NP
Lecture 25 Partition.
Lecture 5 NP Class.
CS21 Decidability and Tractability
Computability and Complexity
Lecture 24 NP-Complete Problems
ICS 353: Design and Analysis of Algorithms
Intro to NP Completeness
Connected Components Minimum Spanning Tree
More NP-complete Problems
Richard Anderson Lecture 25 NP-Completeness
Richard Anderson Lecture 28 NP-Completeness
Approximation Algorithms
Lecture 26 More examples.
Richard Anderson Lecture 30 NP-Completeness
Computation Basics & NP-Completeness
Richard Anderson Lecture 26 NP-Completeness
CS21 Decidability and Tractability
NP-Completeness Yin Tat Lee
The Theory of NP-Completeness
Richard Anderson Lecture 27 Survey of NP Complete Problems
Algorithms Lecture # 27 Dr. Sohail Aslam.
Dominating Set By Eric Wengert.
Hamiltonian Circuit (HC) problem
Lecture 24 Vertex Cover and Hamiltonian Cycle
Presentation transcript:

Lecture 2-4 More examples

Integer Programming TSP Knapsack VC HC 3DM Partition Planar 3SAT 3SAT SAT

Vertex Cover Given a graph G=(V,E), find a minimum subset C of vertices such that every edge is incident to a vertex in C.

Decision Version Given a graph G=(V,E) and positive integer k < |V|, is there a vertex cover C of size at most k?.

Vertex-Cover is NP-complete Proof.

HC is NP-complete

3DM

Example of 3DM Messrs. Spinnaker, Buoy, Luff, Gybe, and Windward are yacht owners. Each has a daughter, and each has named his yacht after the daughter of one of the others. Mr. Spinnaker’s yacht, the Iris, is named after Mr. Buoy’s daughter. Mr. Buoy’s own yacht is the Daffodil; Mr. Windward’s yacht is the Jonquil; Mr. Gybe’s, the Anthea. Daffodil is the daughter of the owner of the yacht which is named after Mr. Luff’s daughter. Mr. Windward’s daughter is named Lalage. Who is Jonquil’s father?

Trash Can ( )

Partition

Subsum

S=33333333333333333333 1111111111111111111111 1 1

Puzzle Answer

Planar 3SAT

Planar CNF

Strongly Planar CNF

A strongly planar CNF must be a planar CNF!!!

2-3CNF

Planar 2-3SAT

Strongly Planar 2-3SAT

Planar 3SAT

Want to show