Shortest Paths. CSE 421 Algorithms. Bottleneck Shortest Path. Negative Cost Edge Preview. Compute the bottleneck shortest paths

Similar documents
CSE 421 Algorithms. Warmup. Dijkstra s Algorithm. Single Source Shortest Path Problem. Construct Shortest Path Tree from s

Jonathan Turner Exam 2-10/28/03

Mathcad Lecture #4 In-class Worksheet Vectors and Matrices 1 (Basics)

Combinatorial Optimization

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Graphs: Paths, trees and flows

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

RUTH. land_of_israel: the *country *which God gave to his people in the *Old_Testament. [*map # 2]

Global Solutions of the SKT Model in Population Dynamics

1. Introduction and notations.

CS 541 Algorithms and Programs. Exam 2 Solutions. Jonathan Turner 11/8/01

3+<6,&6([DP. September 29, SID (last 5 digits): --

Final Exam : Solutions

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

Fourier. Continuous time. Review. with period T, x t. Inverse Fourier F Transform. x t. Transform. j t

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

Planar Upward Drawings

Flow Networks Alon Efrat Slides courtesy of Charles Leiserson with small changes by Carola Wenk. Flow networks. Flow networks CS 445

CSC 373: Algorithm Design and Analysis Lecture 9

Weighted Graphs. Weighted graphs may be either directed or undirected.

,. *â â > V>V. â ND * 828.

Single Correct Type. cos z + k, then the value of k equals. dx = 2 dz. (a) 1 (b) 0 (c)1 (d) 2 (code-v2t3paq10) l (c) ( l ) x.

Lecture 20: Minimum Spanning Trees (CLRS 23)

COMP108 Algorithmic Foundations

n

Statistics Assessing Normality Gary W. Oehlert School of Statistics 313B Ford Hall

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE!

1 Introduction to Modulo 7 Arithmetic

Design and Analysis of Algorithms (Autumn 2017)

Eager st-ordering. Universität Konstanz. Ulrik Brandes. Konstanzer Schriften in Mathematik und Informatik Nr. 171, April 2002 ISSN

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

rhtre PAID U.S. POSTAGE Can't attend? Pass this on to a friend. Cleveland, Ohio Permit No. 799 First Class

XV Exponential and Logarithmic Functions

Intersection Testing Chapter 16. Department of Computer Engineering Chalmers University of Technology

PR D NT N n TR T F R 6 pr l 8 Th Pr d nt Th h t H h n t n, D D r r. Pr d nt: n J n r f th r d t r v th tr t d rn z t n pr r f th n t d t t. n

16.512, Rocket Propulsion Prof. Manuel Martinez-Sanchez Lecture 3: Ideal Nozzle Fluid Mechanics

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Eager st-ordering. 1 Introduction. Ulrik Brandes

4.1 Interval Scheduling. Chapter 4. Greedy Algorithms. Interval Scheduling: Greedy Algorithms. Interval Scheduling. Interval scheduling.

Midterm. Answer Key. 1. Give a short explanation of the following terms.

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

0 t b r 6, 20 t l nf r nt f th l t th t v t f th th lv, ntr t n t th l l l nd d p rt nt th t f ttr t n th p nt t th r f l nd d tr b t n. R v n n th r


46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th

2. The Laplace Transform

BASE MAP ZONING APPLICATION ENGLER TRACT KELLER, TEXAS

Boyce/DiPrima 9 th ed, Ch 2.1: Linear Equations; Method of Integrating Factors

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

1K21 LED GR N +33V 604R VR? 1K0 -33V -33V 0R0 MUTE SWTH? JA? T1 T2 RL? +33V 100R A17 CB? 1N N RB? 2K0 QBI? OU T JE182 4K75 RB? 1N914 D?

1 Finite Automata and Regular Expressions

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

5/1/2018. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees. Huffman Coding Trees

Library Support. Netlist Conditioning. Observe Point Assessment. Vector Generation/Simulation. Vector Compression. Vector Writing

On the Existence and uniqueness for solution of system Fractional Differential Equations

CONSTACYCLIC CODES OF LENGTH OVER A FINITE FIELD

Solutions to assignment 3

Relation between Fourier Series and Transform

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Right Angle Trigonometry

Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v

d e c b a d c b a d e c b a a c a d c c e b

KITAGAWA NC TILTING ROTARY TABLES

Spanning Trees. BFS, DFS spanning tree Minimum spanning tree. March 28, 2018 Cinda Heeren / Geoffrey Tien 1

Math 266, Practice Midterm Exam 2

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

Engine Thrust. From momentum conservation

22 t b r 2, 20 h r, th xp t d bl n nd t fr th b rd r t t. f r r z r t l n l th h r t rl T l t n b rd n n l h d, nd n nh rd f pp t t f r n. H v v d n f

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Colby College Catalogue

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Chapter 3. The Fourier Series

University of Bristol - Explore Bristol Research. Publisher's PDF, also known as Version of record

CS3510 Design & Analysis of Algorithms Fall 2017 Section A. Test 3 Solutions. Instructor: Richard Peng In class, Wednesday, Nov 15, 2017


(Minimum) Spanning Trees

4 8 N v btr 20, 20 th r l f ff nt f l t. r t pl n f r th n tr t n f h h v lr d b n r d t, rd n t h h th t b t f l rd n t f th rld ll b n tr t d n R th

FL/VAL ~RA1::1. Professor INTERVI of. Professor It Fr recru. sor Social,, first of all, was. Sys SDC? Yes, as a. was a. assumee.

Maximum Flow. Flow Graph

Labeling Problem & Graph-Based Solution

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS


Colby College Catalogue

The AN/ARC-54. Module Circuit Diagrams

Face Detection and Recognition. Linear Algebra and Face Recognition. Face Recognition. Face Recognition. Dimension reduction

a dt a dt a dt dt If 1, then the poles in the transfer function are complex conjugates. Let s look at f t H t f s / s. So, for a 2 nd order system:

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

I I. R E L A T E D W O R K

CS 241 Analysis of Algorithms

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

Colby College Catalogue

Canonical Quantizing of Spinor Fields: Anti-Commutation Relations

SWAGELOK BRISTOL SOPFAB SOPFAB04-AR-271A/B SAMPLE TO ANALYSER SURPLUS TUBE CUTBACK TO SUIT AIR IN CAL 1 FLARE CAL 2 STEAM IN AIR IN

n r t d n :4 T P bl D n, l d t z d th tr t. r pd l

Transcription:

Shor Ph CSE Alorihm Rihr Anron Lr 0- Minimm Spnnin Tr Ni Co E Dijkr lorihm m poii o For om ppliion, ni o mk n Shor ph no wll in i rph h ni o yl - - - Ni Co E Priw Topoloil Sor n or olin h hor ph prolm in ir yli rph Bllmn-For lorihm in hor ph in rph wih ni o (or rpor h xin o ni o yl). Bolnk Shor Ph Din h olnk in or ph o h mximm o lon h ph x Comp h olnk hor ph Dijkr Alorihm or Bolnk Shor Ph S = {}; [] = ni ininiy; [] = ininiy or!= - - Whil S!= V Choo in V-S wih minimm [] A o S For h w in h nihorhoo o [w] = min([w], mx([], (, w))) y x z

Minimm Spnnin Tr Minimm Spnnin Tr Inro Prolm Dmonr hr irn ry lorihm Proi proo h h lorihm work 0 9 0 8 Gry Alorihm or Minimm Spnnin Tr Exn r y inlin h hp o oin A h hp h join ijoin omponn Dl h mo xpni h o no ionn h rph 0 8 Gry Alorihm Prim Alorihm Exn r y inlin h hp o oin Conr h MST wih Prim lorihm rin rom rx Ll h in orr o inrion 9 0 0 8 Gry Alorihm Krkl Alorihm A h hp h join ijoin omponn Gry Alorihm Rr-Dl Alorihm Dl h mo xpni h o no ionn h rph Conr h MST wih Krkl lorihm Ll h in orr o inrion 0 9 0 8 Conr h MST wih h rrl lorihm Ll h in orr o rmol 0 9 0 8

Why o h ry lorihm work? For impliiy, m ll o r iin L S o V, n ppo = (, ) i h minimm o o E, wih in S n in V-S i in ry minimm pnnin r Proo Sppo T i pnnin r h o no onin A o T, hi r yl Th yl m h om = (, ) wih in S n in V-S T = T { } + {} i pnnin r wih lowr o Hn, T i no minimm pnnin r Opimliy Proo Prim Alorihm omp MST Rr-Dl Alorihm Lmm: Th mo xpni on yl i nr in minimm pnnin r Krkl Alorihm omp MST Dlin wih h mpion o no ql wih For h wih o iin A mll qnii o h wih Gi i rkin rl or ql wih Dijkr Alorihm or Minimm Spnnin Tr S = {}; [] = 0; [] = ininiy or!= Whil S!= V Choo in V-S wih minimm [] A o S For h w in h nihorhoo o [w] = min([w], (, w)) y x z

Minimm Spnnin Tr 0 9 0 8 Unir Grph G=(V,E) wih wih Gry Alorihm or Minimm Spnnin Tr [Prim] Exn r y inlin h hp o oin [Krkl] A h hp h join ijoin omponn [RrDl] Dl h mo xpni h o no ionn h rph 0 8 Why o h ry lorihm work? For impliiy, m ll o r iin E inlion lmm L S o V, n ppo = (, ) i h minimm o o E, wih in S n in V-S i in ry minimm pnnin r o G Or qilnly, i i no in T, hn T i no minimm pnnin r S V - S i h minimm o wn S n V-S Proo Opimliy Proo Sppo T i pnnin r h o no onin A o T, hi r yl Th yl m h om = (, ) wih in S n in V-S S V - S T = T { } + {} i pnnin r wih lowr o Hn, T i no minimm pnnin r Prim Alorihm omp MST Krkl Alorihm omp MST Show h whn n i o h MST y Prim or Krkl, h i h minimm o wn S n V-S or om S.

S = { }; T = { }; whil S!= V Prim Alorihm Pro Prim lorihm omp n MST Show n i in h MST whn i i o T hoo h minimm o = (,), wih in S, n in V-S o T o S Krkl Alorihm L C = {{ }, { },..., { n }}; T = { } whil C > Pro Krkl lorihm omp n MST Show n i in h MST whn i i o T L = (, ) wih in C i n in C j h minimm o joinin iin in C Rpl C i n C j y C i U C j A o T Rr-Dl Alorihm Lmm: Th mo xpni on yl i nr in minimm pnnin r Dlin wih h mpion o no ql wih For h wih o iin A mll qnii o h wih Gi i rkin rl or ql wih

Appliion: Clrin Gin ollion o poin in n r- imnionl p, n n inr K, ii h poin ino K h r lo ohr Din lrin Dii h ino K o mximiz h in wn ny pir o i (S, S ) = min {i(x, y) x in S, yins} Dii ino lr Dii ino lr Dii ino lr Din Clrin Alorihm L C = {{ }, { },..., { n }}; T = { } whil C > K L = (, ) wih in C i n in C j h minimm o joinin iin in C Rpl C i n C j y C i U C j

K-lrin