Overview. Splay trees. Balanced binary search trees. Inge Li Gørtz. Self-adjusting BST (Sleator-Tarjan 1983).

Similar documents
Overview. Splay trees. Balanced binary search trees. Inge Li Gørtz. Self-adjusting BST (Sleator-Tarjan 1983).

Copyright A.Milenin, 2017, AGH University of Science and Technology

- Double consonant - Wordsearch 3

Trader Horn at Strand This Week

Canonical Quantizing of Spinor Fields: Anti-Commutation Relations

Jonathan Turner Exam 2-10/28/03

CHARACTERIZATION FROM EXPONENTIATED GAMMA DISTRIBUTION BASED ON RECORD VALUES

LAUREL HILL VERMONT APRIL 2014

Appendix. In the absence of default risk, the benefit of the tax shield due to debt financing by the firm is 1 C E C

The Mathematics of Harmonic Oscillators

COURT PLAZA BUILDING CLADDING REPLACEMENT

Server breakdown and repair, Multiple vacation, Closedown, Balking and Stand-by server.

NAME: ANSWER KEY DATE: PERIOD. DIRECTIONS: MULTIPLE CHOICE. Choose the letter of the correct answer.

S tu d y P la n n e d Leader9s Expulsion Protested

SSSf. 2 Were Killed' RepresentnUvesrl

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.

BND Summer School in Particle Physics 2016 Early Experimental Tests of QCD

O M N I W I L L I A M P E N N H O T E L H O L I D A Y

Generalized Half Linear Canonical Transform And Its Properties

Chapter 14: Optical Parametric Oscillators

1 Finite Automata and Regular Expressions

[ ]:543.4(075.8) 35.20: ,..,..,.., : /... ;. 2-. ISBN , - [ ]:543.4(075.8) 35.20:34.

STATE SPACE CONTROL. Prof. Ing. Miluše Vítečková, CSc. Prof. Ing. Antonín Víteček, CSc., Dr.h.c.

J = 1 J = 1 0 J J =1 J = Bout. Bin (1) Ey = 4E0 cos(kz (2) (2) (3) (4) (5) (3) cos(kz (1) ωt +pπ/2) (2) (6) (4) (3) iωt (3) (5) ωt = π E(1) E = [E e

Data, frameworks, and financial instrument identification

SYMMETRICAL COMPONENTS

ktmuwii INDEPENDENT IN Al.t THINCIS. NEUTRAL IN NOTHING* Sold at Cast. AI.GE" IS DKVI). Lowell's Bright Boy Stricken With Small Pox at Manila.

Grid Game Policing Poses Problem

SAN JOSE CITY COLLEGE PHYSICAL EDUCATION BUILDING AND RENOVATED LAB BUILDING SYMBOL LIST & GENERAL NOTES - MECHANICAL

, k fftw ' et i 7. " W I T H M A. L I O E T O W A R 3 D JSrOKTE X l S T E O H A R I T Y F O R A L L. FIRE AT^ 10N1A, foerohlng * M».

Strongly connected components. Finding strongly-connected components

VIRGINIA PORT AUTHORITY

5 H o w t o u s e t h e h o b 1 8

Original. Public-Private Transportation Act Detailed Proposal ROUTE 28 PHASE III. Linton Hall Road to Pennsylvania Avenue Prince William Count y, VA

Introduction to Inertial Dynamics

Colby College Catalogue

I M P O R T A N T S A F E T Y I N S T R U C T I O N S W h e n u s i n g t h i s e l e c t r o n i c d e v i c e, b a s i c p r e c a u t i o n s s h o

How to Make a Zia. (should you ever be inclined to do such a thing)

APRIL, 2013 I S T R I C C H O O L N C E X SHEET NO. T E U S T O X A COVER SHEET CS1 SP1 SITE PLAN RP1 DS1 DETAILS DS2 DETAILS DETAILS DS3 DETAILS

Colby College Catalogue

Advanced Queueing Theory. M/G/1 Queueing Systems

TRASH ENCLOSURE WITH SOLID GATE 4 STORY BUSINESS / RESIDENTIAL BUILDING CONTAINING 2 BUSINESS SPACES AND 6 DWELLING UNITS 6' - 0"

L.3922 M.C. L.3922 M.C. L.2996 M.C. L.3909 M.C. L.5632 M.C. L M.C. L.5632 M.C. L M.C. DRIVE STAR NORTH STAR NORTH NORTH DRIVE

Colby College Catalogue

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

Analytical Evaluation of Multicenter Nuclear Attraction Integrals for Slater-Type Orbitals Using Guseinov Rotation-Angular Function

Factors Success op Ten Critical T the exactly what wonder may you referenced, being questions different the all With success critical ten top the of l

Dg -Trrr hrugh Nwrk-- M qu (NM) I V. L ITERATURE RE VIEW Mqu y gr r I y hu y wrh ryr. Durg r rh r ur, qu wr u h hqurr h I ur rh, r u rg, h whr u wr r

THE LOWELL LEDGER. INDEPENDENT-NOT NEUTRAL.

Net Wt. 15 lbs. (6.8 kg) Covers 5,000 Sq. Ft. CAUTION CAUTION L AW N Storage and Disposal KEEP OUT OF REACH OF CHILDREN. Spreader Directions

" W I T H M A L I C E T O W A - P t D N O I S T E A - I S T D O H A n i T Y F O R. A L L. " A TENDERFOOT. an awful storm." At this juncture,


Erlkönig. t t.! t t. t t t tj "tt. tj t tj ttt!t t. e t Jt e t t t e t Jt

Colby College Catalogue

Mains LasagneAlForno LinguineCarbonara PenneGorgonzolawithRocket VPenneSorrentino(Addchickenfor 1) VLasagneVerdura

P a g e 5 1 of R e p o r t P B 4 / 0 9

PROJECT SCOPE RESIDENTIAL

Applications of trees

SAMPLE LITANY OF THE SAINTS E/G. Dadd9/F. Aadd9. cy. Christ, have. Lord, have mer cy. Christ, have A/E. Dadd9. Aadd9/C Bm E. 1. Ma ry and. mer cy.

Investigations of Copper Corrosion at Willmar, Minnesota

Y'* C 0!),.1 / ; ')/ Y 0!)& 1 0R NK& A Y'. 1 ^. ]'Q 1 I1 )H ;". D* 1 = Z)& ^. H N[Qt C =

Baby Beauty Contest Judging Today In WR Recreation Halt

Wave Phenomena Physics 15c

Campsites are approximately 20 wide x 50 deep. Campsites must be paid for when the site is staked.

V A. V-A ansatz for fundamental fermions

Acogemos, Señor, Tu Mensaje De Amor/ Embrace And Echo Your Word

Cherrywood House, Cherrywood Road, Loughlinstown, Dublin 18

A L A BA M A L A W R E V IE W

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

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

A Simple Representation of the Weighted Non-Central Chi-Square Distribution

828.^ 2 F r, Br n, nd t h. n, v n lth h th n l nd h d n r d t n v l l n th f v r x t p th l ft. n ll n n n f lt ll th t p n nt r f d pp nt nt nd, th t

10.5 Linear Viscoelasticity and the Laplace Transform

Executive Committee and Officers ( )

n

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

! -., THIS PAGE DECLASSIFIED IAW EQ t Fr ra _ ce, _., I B T 1CC33ti3HI QI L '14 D? 0. l d! .; ' D. o.. r l y. - - PR Pi B nt 8, HZ5 0 QL

Tries and Suffix Trees. Inge Li Gørtz

NORTHING 2" INS. COPPER COMM. CABLE 6" D.I. WATER LINE 52 12" D.I. WATER LINE 645, ,162, CURVE DATA US 40 ALT.

M A. L I O E T O W A R D N O N E A. N I D O H A R I T Y F O R A L L. " An Old Timor's DesorSptlon of HI* Camp Outfit. THE DEATH OF M R L A. R. WEEKS.

tcvrn Hl1 J M Hamilton P Eng Chief Geologist Kimberley Northing m Northing m I FEB 24 1QP Northing m Gold Commiuioner

T h e C S E T I P r o j e c t

Chapter 1: Review of Quantum Mechanics. Postulates of Quantum Mechanics: 1-3



176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s

Exam 2 Solutions. Jonathan Turner 4/2/2012. CS 542 Advanced Data Structures and Algorithms

INF5820 MT 26 OCT 2012

NORTHLAKE APARTMENTS

Red Barn R.V. and Boat Storage - Construction Documents

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

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?

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

eight days of debate the G eneral was the c lo sest on record. w as absent. l i l d e n t p a r k i n g p r o b l e m and

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

_ J.. C C A 551NED. - n R ' ' t i :. t ; . b c c : : I I .., I AS IEC. r '2 5? 9

Chapter 7 Stead St y- ate Errors

fiff w 4h WEDNESDAY JULY 23 1SS3 COMKCTIOXKHVI 4 4Ty X 41x1441 as x n rcnsut4 Hotti su KEEPS ALWAYS ON HAND A4 HMlwll l4 Vlt I W

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

LAKEWOOD ELEMENTARY SCHOOL HVAC REPLACEMENT AND COMPOSITION SHINGLE RE-ROOFING PROJECT 2920 MIDDLEBORO PLACE MODESTO, CA BID NO.

Transcription:

Ovrvw Bn nr rh r: R-k r n -- r 00 Ing L Gør Amor n Dnm rogrmmng Nwork fow Srng mhng Srng nng Comuon gomr Inrouon o NP-omn Rnom gorhm Bn nr rh r -- r. Aow,, or k r no Prf n. Evr h from roo o f h m ngh. mr hn E wn E n R E R rgr hn R A A C H I N S S r Sf-jung BST (Sor-Trjn 9). Mo frqun no r o o h roo. Tr rorgn f fr h oron. Afr o no mov o h roo oron. Wor m for nron, on n rh O(n). Amor m r oron O(og n). R-k r. Th roo w k A roo-o-f h hv h m numr of k no. A A C E I R S R no o no hv r hrn A v (NIL) r k H N

Sng Sng S(): o foowng roon un h roo. L h rn of. rgh (or f): f h no grnrn. S(): o foowng roon un h roo. L () h rn of. rgh (or f): f h no grnrn. g-g (or g-g): f on of,() f h n h ohr rgh h. rgh f w w w rgh roon (n f roon ) g-g Sng S(): o foowng roon un h roo. L h rn of. rgh (or f): f h no grnrn. g-g (or g-g): f on of, f h n h ohr rgh h. ror-or: f n () r hr oh f hrn or oh rgh hrn. Dnm mmnon Wor runnng m ( r) Immnon rh nr mnmum mmum uor ror nk O(n) O() O() O(n) O(n) O(n) O(n) orr rr O(og n) O(n) O(n) O() O() O(og n) O(og n) BST O(h) O(h) O(h) O(h) O(h) O(h) O(h) -- r O(og n) O(og n) O(og n) O(og n) O(og n) O(og n) O(og n) r-k r O(og n) O(og n) O(og n) O(og n) O(og n) O(og n) O(og n) r O(og n) O(og n) O(og n) O(og n) O(og n) O(og n) O(og n) : mor runnng m rgh ror-or (n f ror-or )

Amor n Amor n. Dnm Progrmmng Gnr gorhm hnqu Cn u whn h rom hv om uruur : ouon n onru from om ouon o urom. Tm rqur o rform qun of oron vrg ovr h oron rform. Em: nm wh oung n hvng If h fu o h mn o nw rr of ou. If h qurr fu o h mn o nw rr of hf h. Wor m for nron or on: O(n) Amor m for nron n on: O() An qun of n nron n on k m O(n). Em Wgh nrv hung Sgmn qur Squn gnmn Shor h (Bmn-For) Mho. Aggrg mho Aounng mho Pon mho Squn gnmn j f =0 >< f j =0 SA(X,Y j )= >< (, j )+SA(X,Y j ), mn + SA(X,Y j ), ohrw >: >: + SA(X,Y j )} Squn gnmn: Fnng h ouon j f =0 >< f j =0 SA(X,Y j)= >< (, j)+sa(x,y j ), mn + SA(X,Y j ), >: >: + SA(X,Y j)} Pn mr A C G T A 0 ohrw C 0 δ = G 0 T 0 A C A A G T C Pn mr A C A A G T C A C A A G T C C A T G T δ = SA(X 5, Y ) Dn on? A C G T A 0 C 0 G 0 T 0 0 5 7 C 5 A 5 T G 5 T 5 5 5 C A T G T

Bmn-For Em 0 f = 0 OPT(, v) = { mn{opt(,v), mn (v,w) E {OPT(,w) + vw }} ohrw Bmnn-For(G,,) Bmnn-For(G,,) for h no v V M[0,v] = M[0,] = 0. for = o n- for h no v V M[,v] = M[-,v] for h g (v,w) E M[,v] = mn(m[,v], M[-,w] + vw 0 5 7 f 0 for h no v V M[0,v] = M[0,] = 0. for = o n- for h no v V M[,v] = M[-,v] for h g (v,w) E M[,v] = mn(m[,v], M[-,w] + vw 5 9-0 0 0 - f 9 0 Em Em Bmnn-For(G,,) for h no v V M[0,v] = M[0,] = 0. for = o n- for h no v V M[,v] = M[-,v] for h g (v,w) E M[,v] = mn(m[,v], M[-,w] + vw 0 5 7 f 9 0 0 Bmnn-For(G,,) for h no v V M[0,v] = M[0,] = 0. for = o n- for h no v V M[,v] = M[-,v] for h g (v,w) E M[,v] = mn(m[,v], M[-,w] + vw) 0 5 7 59 9 f 9 0 0 0 0 5 9-0 0 0 - f 9 59 5 9 9-0 0 0-9 0 f 9 5 0

Nwork Fow Nwork fow: grh G=(V,E). S vr (our) n (nk). Evr g (u,v) h (u,v) 0. Fow: onrn: vr g h fow 0 f(u,v) (u,v). fow onrvon: for u, : fow no u qu fow ou of u. X f(v, u) = X f(u, v) u v:(v,u)e v:(u,v)e Vu of fow f h um of fow ou of mnu um of fow no : f = X f(, v) X f(v, ) v:(,v)e v:(v,)e Mmum fow rom: fn - fow of mmum vu Nwork fow: - Cu Cu: Pron of vr no S n T, uh h S n T. S T C of u: o of g gong from S o T. Fow ro u: fow from S o T mnu fow from T o S. Vu of fow n fow f (S,T) for n - u (S,T). Suo w hv foun fow f n u (S,T) uh h f = (S,T). Thn f mmum fow n (S,T) mnmum u. Augmnng h Sng gorhm Augmnng h (fnon ffrn hn n CLRS): - h whr forwr g hv fovr kwr g hv ov fow +δ -δ +δ +δ -δ -δ f < f > 0 f < f < f5 > 0 f > 0 Thr no ugmnng h <=> f mmum fow. For-Fukron gorhm: R fn ugmnng h, u, un no ugmnng h Runnng m: O( f* m). Emon-Kr gorhm: R fn hor ugmnng h, u, un no ugmnng h U BFS o fn hor ugmnng h. Runnng m: O(nm ) Fn mnmum u. A vr o whh hr n ugmnng h from go no S, r no T. Sng rmr Δ On onr g wh Δ n ru grh Gf(Δ). Em: Δ = Gf 5 Gf() 5 0

Nwork fow Cn mo n ov mn rom v mmum fow. Mmum r mhng k g-jon h on vr Mn our/nk owr oun on fow on g. gnmn rom: Em. X oor, Y ho, h oor hou work mo ho, h oor v om of h ho. Srng Mhng Srng mhng rom: rng T () n rng P (rn) ovr n h Σ. T = n, P = m. Ror rng oon of ourrn of P n T. Srng mhng uomon. Runnng m: O(n + m Σ ) Knuh-Morr-Pr (KMP). Runnng m: O(m + n) Fn Auomon Fn uomon: h Σ = {,,}. P=. Fn Auomon Fn uomon: h Σ = {,,}. P=. rng ng rng ng ong rf of P h uff of '

Fn Auomon Fn uomon: h Σ = {,,}. P =. Knuh-Morr-Pr (KMP) Mh P[ q]: Fn ong ok P[..k] h mh n of P[..q]. Fn ong rf P[...k] of P h ror uff of P[...q] Arr π[ m]: π[q] = m k < q uh h P[...k] uff of P[ q]. Cn n fn uomon wh fur nk: T = 5 7 5 π[] 0 0 0 KMP mhng KMP: Cn n fn uomon wh fur nk: ong rf of P h uff of wh w hv mh un now. T = 5 Srng Inng Srng nng rom. Gvn rng S of hrr from n h Σ. Prro S no ruur o uor Srh(P): Rurn rng oon of ourrn of P n S. Tr. S Com r. Chn of no wh ng h mrg no ng no Suff r. Com r ovr h uff of rng. S S S S 7 S h S5 h

Srng Inng Srng nng rom. Gvn rng S of hrr from n h Σ. Prro S no ruur o uor Srh(P): Rurn rng oon of ourrn of P n S. Tr. Com r. Chn of no wh ng h mrg no ng no S S S Suff r. Com r ovr h uff of rng. h S 5 S 7 h S S Suff r Suff r. Com r ovr uff of rng. Suff r n u o ov h Srng nng rom n: S: O(n) n Srh m: O(m+o) n Prrong: O(or(n, Σ )) m n n n n 5 7 Suff r Suff r. Com r ovr uff of rng. Long ommon urng Em: Fn ong ommon urng of n : [,] [,] [7,7] [,7] [,] [7,7] [5,7] [7,7] [5,7] 5 [7,7] 7 9....... Suff r n u o ov h Srng nng rom n: S: O(n) Srh m: O(m+o) Prrong: O(or(n, Σ )) m 0 5 n n 5... 7.... 0. 5 7... h ong ommon urng

Rnom gorhm Mn/S. Quk-or Co r Co Pr of Pon: Rnom gorhm U hh o or whh qur on n. On or on r ook (r on). 7 5 δ 5 9 δ 0 Ponom-m ruon Ruon. Prom X onom ru o rom Y f rrr nn of rom X n ov ung: Ponom numr of nr omuon, u Ponom numr of o or h ov rom Y. Noon. X P Y. W for m o wr own nn n o k o nn of Y mu of onom. Ponom-m ruon Puro. Cf rom orng o rv ffu. Dgn gorhm. If X P Y n Y n ov n onom-m, hn X n o ov n onom m. Eh nr. If X P Y n X nno ov n onom-m, hn Y nno ov n onom m. Eh quvn. If X P Y n Y P X, w u noon X =P Y. u o onom for 5

P v NP P ov n rmn onom m. NP ov n non-rmn onom m/ h n ffn (onom m) rfr. P NP (vr rom T whh n P o n NP). I no known (u rong v) whhr h nuon ror, h whhr hr rom n NP whh no n P. Thr u of NP whh onn h hr rom, NP-om rom: X NP-Com f X NP Y P X for Y NP How o rov rom NP-om. Prov X NP (h n vrf n onom m).. S known NP-om rom Y.. Gv onom m ruon from Y o X: En how o urn n nn of Y no on or mor nn of X En how o u onom numr of o h k o gorhm/ or for X o ov Y. Prov/rgu h h ruon orr. 7 How o u gorhm DTU 0 Agorhm for mv 09 Comuon Hr Prom 07 Grh hor 007 Comuon Too for D Sn Th Thnk ou