Kuhn Munkres algorithm Actors A definition There is a label on - PowerPoint PPT Presentation

Dec 18, 2022 •349 likes •557 views

Kuhn Munkres algorithm Actors A definition There is a label on every vertex and its value is L[x]. For any edge (x,y) we make sure that L[x] + L[y] w(x,y). Another definition We define the equivalent subgraph G'. G' includes all the

Kuhn Munkres algorithm Actors
A definition There is a label on every vertex and its value is L[x]. For any edge (x,y) we make sure that L[x] + L[y] ≥ w(x,y).
Another definition We define the equivalent subgraph G'. G' includes all the vertices and all the tight edges. tight: w(x,y) = L[x] + L[y] Actually, we don't care about weight in the G'.
An important lemma If the equivalant subgraph G' has a perfect match, then this match will be the maximum weighted match in G.
New goal Our goal is to find the prefect match in the G'. Welcome Nayun Xu!
A simple description of algorithm procedure Step1. Set a label L[x] for every vertex x. Step2. Get the equivalent subgraph by definition. Step3. If every vertex has been matched , go to Step4. Find a vertex x not matched yet in the left part, and try to find a match vertex y in the right part in the equivalent subgraph. If it is impossible to find a match vertex y for x, then we adjust the vertex label, and go back to Step2, else repeat Step3. Step4. The label now can lead to an equivalent subgraph with a perfect match. And the sum of all the vertex label now is the value of max weight matching.
More details with an example 7
More details with an example 8
More details with an example 9
More details with an example 10
More details with an example 11
More details with an example 12
More details with an example 13
More details with an example 14
Key words in the algorithm 1.vertex label 2.equivalent subgraph 2.find match vertex (network flow or Hungarian algorithm) 3.adjust vertex label
Welcome Kevin Tan
A simple time bound and its proof
A brief introduction to dual problem Actually ...
Thank you for listening!

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Randomization Randomized Algorithm: An

Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Randomization Randomized Algorithm: An algorithm that uses (or can use) random coin flips in order to make decisions We will see: randomization can be a powerful tool to Make

497 views • 21 slides

Divide and Conquer Algorithm Theory WS 2012/13 Fabian Kuhn Divide And Conquer Principle

Chapter 1 Divide and Conquer Algorithm Theory WS 2012/13 Fabian Kuhn Divide And Conquer Principle Important algorithm design method Examples from Informatik 2: Sorting: Mergesort, Quicksort Binary search can be considered

339 views • 22 slides

Discussion Midterm Exam Algorithm Theory WS 2013/14 Fabian Kuhn P1: Maximum Subarray Sum (18pt)

Discussion Midterm Exam Algorithm Theory WS 2013/14 Fabian Kuhn P1: Maximum Subarray Sum (18pt) Algorithm Theory, WS 2013/14 Fabian Kuhn 2 P1: Maximum Subarray Sum (18pt) Divide & Conquer Split array in two parts (left & right):

670 views • 29 slides

Parallel Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Sequential Algorithms Classical

Chapter 8 Parallel Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Sequential Algorithms Classical Algorithm Design: One machine/CPU/process/ doing a computation RAM (Random Access Machine): Basic standard model Unit cost basic

806 views • 22 slides

Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Online Computations Sometimes, an

Chapter 8 Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Online Computations Sometimes, an algorithm has to start processing the input before the complete input is known For example, when storing data in a data structure, the

698 views • 33 slides

Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Online Computations Sometimes, an

385 views • 16 slides

Approximation Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Approximation Algorithms

Chapter 7 Approximation Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Approximation Algorithms Optimization appears everywhere in computer science We have seen many examples, e.g.: scheduling jobs traveling salesperson

694 views • 34 slides

Greedy Algorithms Algorithm Theory WS 2013/14 Fabian Kuhn Traveling Salesperson Problem (TSP)

Chapter 2 Greedy Algorithms Algorithm Theory WS 2013/14 Fabian Kuhn Traveling Salesperson Problem (TSP) Input: Set of nodes (points, cities, locations, sites) Distance function : , i.e., , :

500 views • 24 slides

Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Paging Algorithm Assume a simple memory

Chapter 8 Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Paging Algorithm Assume a simple memory hierarchy: fast memory of size slow memory If a memory page has to be accessed: Page in fast memory (hit): take page from there

580 views • 22 slides

Parallel Algorithms Algorithm Theory WS 2013/14 Fabian Kuhn Parallel Computations : time to

Chapter 9 Parallel Algorithms Algorithm Theory WS 2013/14 Fabian Kuhn Parallel Computations : time to perform comp. with procs : work (total # operations) Time when doing the computation sequentially :

1.08k views • 24 slides

Greedy Algorithms Algorithm Theory WS 2013/14 Fabian Kuhn Greedy Algorithms No clear

Chapter 2 Greedy Algorithms Algorithm Theory WS 2013/14 Fabian Kuhn Greedy Algorithms No clear definition, but essentially: In each step make the choice that looks best at the moment! Depending on problem, greedy algorithms can give

409 views • 40 slides

Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Last Lecture Due to technical problems, we

Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Last Lecture Due to technical problems, we have no recordings We discussed 2 problems Contention resolution: We will put the copy of a book chapter on the web (beginning of Ch.

649 views • 26 slides

Data Structures Algorithm Theory WS 2012/13 Fabian Kuhn Examples Dictionary: Operations:

Chapter 4 Data Structures Algorithm Theory WS 2012/13 Fabian Kuhn Examples Dictionary: Operations: insert( key,value ), delete( key ), find( key ) Implementations: Linked list: all operations take time ( : size of data

489 views • 32 slides

Dynamic Programming Part 2 Algorithm Theory WS 2012/13 Fabian Kuhn Dynamic Programming

Chapter 3 Dynamic Programming Part 2 Algorithm Theory WS 2012/13 Fabian Kuhn Dynamic Programming Memoization for increasing the efficiency of a recursive solution: Only the first time a sub problem is encountered, its solution is

656 views • 26 slides

Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Self Adjusting Lists Linked lists

Chapter 8 Online Algorithms Algorithm Theory WS 2012/13 Fabian Kuhn Self Adjusting Lists Linked lists are often inefficient Cost of accessing an item at position is linear in But, linked lists are extremely simple And

387 views • 9 slides

Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Number of Cuts Theorem: The number of edge

Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Number of Cuts Theorem: The number of edge cuts of size at most in an node graph is at most . Proof: Algorithm Theory, WS 2012/13 Fabian

318 views • 18 slides

Finding Dense Subgraphs via Low-Rank Bilinear Optimization Ioannis Mitliagkas Dimitris

Finding Dense Subgraphs via Low-Rank Bilinear Optimization Ioannis Mitliagkas Dimitris Papailiopoulos with: Alex Dimakis UT Austin Constantine Caramanis Densest k-Subgraph (DkS) Given graph and a parameter k Find k vertices

1.26k views • 66 slides

Finding topological subgraphs is fixed-parameter tractable Martin Grohe 1 Ken-ichi Kawarabayashi 2

Finding topological subgraphs is fixed-parameter tractable Martin Grohe 1 Ken-ichi Kawarabayashi 2 Dniel Marx 1 Paul Wollan 3 1 Humboldt-Universitt zu Berlin, Germany 2 National Institute of Informatics, Tokyo, Japan 3 University of Rome, La

903 views • 50 slides

Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism

Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask) D aniel Marx, Micha l Pilipczuk STACS14, Lyon, March 6 th , 2014 Marx, Pilipczuk Subgraph Isomorphism 1/22

1.2k views • 96 slides

Manufacturing Diagnostic Tool Manufacturing Diagnostic Tool An on board on board low cost

EBTW05 EBTW05 Manufacturing Diagnostic Tool Manufacturing Diagnostic Tool An on board on board low cost diagnostic test solution low cost diagnostic test solution An EBTW 2005, Tallinn, Estonia Slide 1 EBTW05 EBTW05 Agenda Challenges

503 views • 24 slides

A distributed approximation scheme for sleep scheduling in sensor networks Patrik Flor een,

A distributed approximation scheme for sleep scheduling in sensor networks Patrik Flor een, Petteri Kaski, Topi Musto, Jukka Suomela HIIT seminar 23 March 2007 A sensor network Battery-powered sensor devices Maximise the lifetime by

343 views • 32 slides

Distributed Computing in Fault-Prone Dynamic Networks Philipp Brandes, Friedhelm Meyer auf der

Distributed Computing in Fault-Prone Dynamic Networks Philipp Brandes, Friedhelm Meyer auf der Heide ETH Zurich Distributed Computing Group www.disco.ethz.ch Introduction Moving nodes in a dynamic network with changing connections

488 views • 25 slides

VisITMeta Visualizing the security of modern IT environments by using metadata Project

VisITMeta Visualizing the security of modern IT environments by using metadata Project presentation Bastian Hellmann Trust@FHH Research group Hochschule Hannover May 30th, 2012 6th ESUKOM Workshop, Nuremberg Trust@FHH B. Hellmann

378 views • 20 slides

Subgroup analysis: trying to get m ore from less? Stephen Senn Geert Molenberghs* Franz Koenig

Subgroup analysis: trying to get m ore from less? Stephen Senn Geert Molenberghs* Franz Koenig Ralf-Dieter Hilgers FP7 HEALTH 2013 - 602552 1 Consider this trial Insert Text This is a perfectly behaved trial. The point estimate is

266 views • 8 slides