Approximation Algorithms Ola Svensson. Course Information Goal: – Learn the techniques used by studying famous applications Graduate Course FDD3390 6.

Slides:

Advertisements

Similar presentations

Instructor Neelima Gupta Table of Contents Approximation Algorithms.

Advertisements

Greedy Algorithms Spanning Trees Chapter 16, 23. What makes a greedy algorithm? Feasible –Has to satisfy the problem’s constraints Locally Optimal –The.

Approximation Algorithms for TSP

1 The TSP : Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell ( )

NP-Complete Problems Polynomial time vs exponential time

Combinatorial Algorithms

Minimum Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.

Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.

7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.

Approximation Algorithms: Combinatorial Approaches Lecture 13: March 2.

The Evolution Trees From: Computational Biology by R. C. T. Lee S. J. Shyu Department of Computer Science Ming Chuan University.

Approximation Algorithms1. 2 Outline and Reading Approximation Algorithms for NP-Complete Problems (§13.4) Approximation ratios Polynomial-Time Approximation.

Approximation Algorithms Lecture for CS 302. What is a NP problem? Given an instance of the problem, V, and a ‘certificate’, C, we can verify V is in.

1 Approximation Algorithms CSC401 – Analysis of Algorithms Lecture Notes 18 Approximation Algorithms Objectives: Typical NP-complete problems Approximation.

The Theory of NP-Completeness

Approximation Algorithms for the Traveling Salesperson Problem.

[1][1][1][1] Lecture 2-3: Coping with NP-Hardness of Optimization Problems in Practice May 26 + June 1, Introduction to Algorithmic Wireless.

1 NP-Complete Problems Polynomial time vs exponential time –Polynomial O(n k ), where n is the input size (e.g., number of nodes in a graph, the length.

Ch 13 – Backtracking + Branch-and-Bound

NP-Complete Problems (Fun part)

1 Combinatorial Dominance Analysis Keywords: Combinatorial Optimization (CO) Approximation Algorithms (AA) Approximation Ratio (a.r) Combinatorial Dominance.

Vertex cover problem S  V such that for every {u,v}  E u  S or v  S (or both)

More Graph Algorithms Weiss ch Exercise: MST idea from yesterday Alternative minimum spanning tree algorithm idea Idea: Look at smallest edge not.

Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.

1 NP-Complete Problems (Fun part) Polynomial time vs exponential time –Polynomial O(n k ), where n is the input size (e.g., number of nodes in a graph,

Programming & Data Structures

Hon Wai Leong, NUS (CS6234, Spring 2009) Page 1 Copyright © 2009 by Leong Hon Wai CS6234 Lecture 1 -- (14-Jan-09) “Introduction”  Combinatorial Optimization.

1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.

Chapter 12 Coping with the Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved.

University of Texas at Arlington Srikanth Vadada Kishan Kumar B P Fall CSE 5311 Solving Travelling Salesman Problem for Metric Graphs using MST.

1 The TSP : NP-Completeness Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell.

1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.

Advanced Algorithm Design and Analysis (Lecture 13) SW5 fall 2004 Simonas Šaltenis E1-215b

Great Theoretical Ideas in Computer Science.

Minimum Routing Cost Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan.

Approximation Algorithms

Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Approximation Algorithms These lecture slides are adapted from CLRS.

CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.

Projects Network Theory VLSI PSM 1. Network 1. Steiner trees

Lecture 6 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.

TSP – Upper Bounds and Lower Bounds Initial problem : Upper Bound A salesman based in Stockton needs to visit shops based in Darlington, Billingham, Middlesbrough,

WK15. Vertex Cover and Approximation Algorithm By Lin, Jr-Shiun Choi, Jae Sung.

Approximation Algorithms for TSP Tsvi Kopelowitz 1.

David Luebke 1 2/18/2016 CS 332: Algorithms NP Completeness Continued: Reductions.

Optimization/Decision Problems Optimization Problems – An optimization problem is one which asks, “What is the optimal solution to problem X?” – Examples:

Approximation Algorithms Guo QI, Chen Zhenghai, Wang Guanhua, Shen Shiqi, Himeshi De Silva.

Lecture. Today Problem set 9 out (due next Thursday) Topics: –Complexity Theory –Optimization versus Decision Problems –P and NP –Efficient Verification.

Approximation Algorithms by bounding the OPT Instructor Neelima Gupta

Instructor Neelima Gupta Table of Contents Introduction to Approximation Algorithms Factor 2 approximation algorithm for TSP Factor.

COSC 3101A - Design and Analysis of Algorithms 14 NP-Completeness.

Traveling Salesman Problem DongChul Kim HwangRyol Ryu.

1 Minimum Spanning Tree: Solving TSP for Metric Graphs using MST Heuristic Soheil Shafiee Shabnam Aboughadareh.

The travelling salesman problem Finding an upper bound using minimum spanning trees Find a minimum spanning tree using Prim’s algorithm or Kruskal’s algorithm.

TU/e Algorithms (2IL15) – Lecture 11 1 Approximation Algorithms.

Approximation Algorithms

School of Computing Clemson University Fall, 2012

Approximation Algorithms

Hamiltonian Cycle and TSP

Hamiltonian Cycle and TSP

Approximation Algorithms

Computability and Complexity

Approximation Algorithms for TSP

Minimum Spanning Trees

Approximation Algorithms

Minimum Spanning Trees

Minimum Spanning Trees

EMIS 8373: Integer Programming

Minimum Spanning Trees

Lecture 24 Vertex Cover and Hamiltonian Cycle

Presentation transcript:

Approximation Algorithms Ola Svensson

Course Information Goal: – Learn the techniques used by studying famous applications Graduate Course FDD Points One Lecture a Week Examination Topics

Teacher Information Ola Svensson Room: 1444 PhD on Approximation Algorithms Second year post-doc First time responsible for a course: you have a lot of influence feedback during course welcome! First time responsible for a course: you have a lot of influence feedback during course welcome!

Approximation Algorithms Optimization problems Not tractable (NP-hard) Want to find good solution 1000 Optimal Tour Length Google Tour 3000 Ola’s Tour 1700

r-Approximation Algorithm A polynomial time algorithm that – returns a feasible solution – with value at most if minimization – with value at least if maximization For any instance: OPT

Impossible to Analyze? How can we compare our solution to the optimal that we cannot compute? OPT lower bound optimal value lb

Example: TSP (1/4) Given n cities with distances between them Find the shortest tour that visits each city at least once d(1,2)

Lower bound (2/4) Removing one edge gives a spanning tree Kruskal’s algorithm runs in time O(n 2 log n)

Constructing tour from MST (3/4) Run DFS on MST – Each vertex is visited at least once – Each edge traversed at most twice Value of tour at most

2-Approximation Algorithm (4/4) 1.Find MST as lower bound 2.Construct tour by running DFS on MST OPT MST2*MST

Summary Lower bound optimal value Constructing feasible solutions that is “close to” bound Verifying that analysis is tight OPT lb