Lecture 11 Overview Self-Reducibility.

Slides:



Advertisements
Similar presentations
Lecture 11 Overview Self-Reducibility. Overview on Greedy Algorithms.
Advertisements

Approximation Algorithms
Greedy Algorithms.
The Greedy Method1. 2 Outline and Reading The Greedy Method Technique (§5.1) Fractional Knapsack Problem (§5.1.1) Task Scheduling (§5.1.2) Minimum Spanning.
Chapter 5 Fundamental Algorithm Design Techniques.
Cs333/cutler Greedy1 Introduction to Greedy Algorithms The greedy technique Problems explored –The coin changing problem –Activity selection.
Merge Sort 4/15/2017 6:09 PM The Greedy Method The Greedy Method.
Reuven Bar-Yehuda Gleb Polevoy Gleb Polevoy Dror Rawitz Technion Technion 1.
Reuven Bar-Yehuda Gleb Polevoy Gleb Polevoy Dror Rawitz Technion Technion 1.
Greedy Algorithms for Matroids Andreas Klappenecker.
1 Ecole Polytechnque, Nov 7, 2007 Scheduling Unit Jobs to Maximize Throughput Jobs:  all have processing time (length) = 1  release time r j  deadline.
1 Combinatorial Dominance Analysis The Knapsack Problem Keywords: Combinatorial Dominance (CD) Domination number/ratio (domn, domr) Knapsack (KP) Incremental.
A Unified Approach to Approximating Resource Allocation and Scheduling Amotz Bar-Noy.……...AT&T and Tel Aviv University Reuven Bar-Yehuda….Technion IIT.
Lecture 36 CSE 331 Dec 2, Graded HW 8 END of the lecture.
Lecture 37 CSE 331 Dec 1, A new grading proposal Towards your final score in the course MAX ( mid-term as 25%+ finals as 40%, finals as 65%) .
Lecture 10 Matroid. Independent System Consider a finite set S and a collection C of subsets of S. (S,C) is called an independent system if i.e., it is.
Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.
1 The Greedy Method CSC401 – Analysis of Algorithms Lecture Notes 10 The Greedy Method Objectives Introduce the Greedy Method Use the greedy method to.
9/3/10 A. Smith; based on slides by E. Demaine, C. Leiserson, S. Raskhodnikova, K. Wayne Guest lecturer: Martin Furer Algorithm Design and Analysis L ECTURE.
Polyhedral Optimization Lecture 5 – Part 1 M. Pawan Kumar Slides available online
Lecture 16 Maximum Matching. Incremental Method Transform from a feasible solution to another feasible solution to increase (or decrease) the value of.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 8.
Chapter 2 Greedy Strategy I. Independent System Ding-Zhu Du.
CSCI 256 Data Structures and Algorithm Analysis Lecture 6 Some slides by Kevin Wayne copyright 2005, Pearson Addison Wesley all rights reserved, and some.
The Greedy Method. The Greedy Method Technique The greedy method is a general algorithm design paradigm, built on the following elements: configurations:
Spring 2008The Greedy Method1. Spring 2008The Greedy Method2 Outline and Reading The Greedy Method Technique (§5.1) Fractional Knapsack Problem (§5.1.1)
Submodularity Reading Group Matroids, Submodular Functions M. Pawan Kumar
Submodularity Reading Group Matroids, Submodular Functions M. Pawan Kumar
Greedy Algorithms General principle of greedy algorithm
Greedy Algorithms – Chapter 5
Chapter 8 Local Ratio II. More Example
Moran Feldman The Open University of Israel
Merge Sort 7/29/ :21 PM The Greedy Method The Greedy Method.
Richard Anderson Lecture 17 Dynamic Programming
Greedy Algorithms Basic idea Connection to dynamic programming
Chapter 4 Greedy Algorithms
Greedy Algorithms / Interval Scheduling Yin Tat Lee
CS200: Algorithm Analysis
Accessible Set Systems
Lecture 16 Maximum Matching
Lecture 9 Greedy Strategy
Merge Sort 11/28/2018 2:18 AM The Greedy Method The Greedy Method.
Merge Sort 11/28/2018 2:21 AM The Greedy Method The Greedy Method.
Merge Sort 11/28/2018 8:16 AM The Greedy Method The Greedy Method.
Coping With NP-Completeness
Richard Anderson Lecture 16 Dynamic Programming
Coverage Approximation Algorithms
Lecture 11 Overview Self-Reducibility.
Richard Anderson Lecture 16a Dynamic Programming
Richard Anderson Lecture 16 Dynamic Programming
Greedy Algorithms.
Merge Sort 1/17/2019 3:11 AM The Greedy Method The Greedy Method.
Weighted Interval Scheduling
Graph Searching.
Richard Anderson Lecture 6 Greedy Algorithms
Richard Anderson Autumn 2016 Lecture 7
Richard Anderson Lecture 7 Greedy Algorithms
A Unified Approach to Approximating Resource Allocation and Scheduling
Lecture 14 Shortest Path (cont’d) Minimum Spanning Tree
Lecture 36 CSE 331 Nov 28, 2011.
Lecture 36 CSE 331 Nov 30, 2012.
Weighted Interval Scheduling
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Richard Anderson Winter 2019 Lecture 7
Richard Anderson Lecture 16, Winter 2019 Dynamic Programming
Merge Sort 5/2/2019 7:53 PM The Greedy Method The Greedy Method.
Richard Anderson Autumn 2015 Lecture 7
Coping With NP-Completeness
Lecture 13 Shortest Path (cont’d) Minimum Spanning Tree
Richard Anderson Autumn 2019 Lecture 7
Presentation transcript:

Lecture 11 Overview Self-Reducibility

Overview on Greedy Algorithms Self-Reducibility Exchange Property Matroid

Local Ratio Method

Basic Idea

Activity Selection

Puzzle

Independent Set in Interval Graphs Activity 9 Activity 8 Activity 7 Activity 6 Activity 5 Activity 4 Activity 3 Activity 2 Activity 1 time We must schedule jobs on a single processor with no preemption. Each job may be scheduled in one interval only. The problem is to select a maximum weight subset of non-conflicting jobs.

Independent Set in Interval Graphs Slide from http://www.cs.technion.ac.il/~reuven/STOC2000.ppt Independent Set in Interval Graphs Activity9 Activity8 Activity7 Activity6 Activity5 Activity4 Activity3 Activity2 Activity1 time Maximize s.t. For each instance I For each time t

Maximal Solutions We say that a feasible schedule is I-maximal if either it contains instance I, or it does not contain I but adding I to it will render it infeasible. Activity9 Activity8 Activity7 Activity6 Activity5 Activity4 Activity3 Activity2 Activity1 I2 I1 time The schedule above is I1-maximal and also I2-maximal

An effective profit function Slide from http://www.cs.technion.ac.il/~reuven/STOC2000.ppt An effective profit function Activity9 Activity8 Activity7 Activity6 Activity5 Activity4 Activity3 Activity2 Activity1 P1=0 P1= P(Î) P1=0 P1=0 P1=0 P1= P(Î) P1=0 P1= P(Î) P1= P(Î) Î Let Î be an interval that ends first;

An effective profit function Slide from http://www.cs.technion.ac.il/~reuven/STOC2000.ppt An effective profit function Activity9 Activity8 Activity7 Activity6 Activity5 Activity4 Activity3 Activity2 Activity1 P1=0 P1= P(Î) P1=0 P1=0 P1=0 P1= P(Î) P1=0 P1= P(Î) P1= P(Î) Î For every feasible solution x: p1 ·x  p(Î) For every Î-maximal solution x: p1 ·x  p(Î) Every Î-maximal is optimal.

Independent Set in Interval Graphs: An Optimization Algorithm Slide from http://www.cs.technion.ac.il/~reuven/STOC2000.ppt Independent Set in Interval Graphs: An Optimization Algorithm Algorithm MaxIS( S, p ) If S = Φ then return Φ ; If I  S p(I) 0 then return MaxIS( S - {I}, p); Let Î  S that ends first; I  S define: p1 (I) = p(Î)  (I in conflict with Î) ; IS = MaxIS( S, p- p1 ) ; If IS is Î-maximal then return IS else return IS  {Î};

Running Example P(I5) = 3 -4 P(I6) = 6 -4 -2 P(I3) = 5 -5 P(I2) = 3 -5 Slide from http://www.cs.technion.ac.il/~reuven/STOC2000.ppt Running Example P(I5) = 3 -4 P(I6) = 6 -4 -2 P(I3) = 5 -5 P(I2) = 3 -5 P(I1) = 5 -5 P(I4) = 9 -5 -4 -4 -5 -2

Minimum Weight Arborescence

Definition

Problem

Key Point 1

Key Point 2

Why?

Key Point 3

A Property of MST