Solving Evacuation Problems Efficiently. Earliest Arrival Flows with Multiple Sources
|
|
- Melanie Nicholson
- 5 years ago
- Views:
Transcription
1 Solving Evcuion Prolem Efficienly Erlie Arrivl Flow wih Muliple Source Ndine Bumnn Univeriä Dormund, FB Mhemik 441 Dormund, Germny Mrin Skuell Univeriä Dormund, FB Mhemik 441 Dormund, Germny Arc Erlie rrivl flow cpure he eence of evcuion plnning. Given nework wih cpciie nd rni ime on he rc, ue of ource node wih upplie nd ink node, he k i o end he given upplie from he ource o he ink quickly poile. The ler requiremen i mde more precie y he erlie rrivl propery which require h he ol moun of flow h h rrived he ink i mximl for ll poin in ime imulneouly. I i clicl reul from he 1970 h, for he pecil ce of ingle ource node, erlie rrivl flow do exi nd cn e compued y eenilly pplying he Succeive Shore Ph Algorihm for minco flow compuion. While i h previouly een oerved h n erlie rrivl flow ill exi for muliple ource, he prolem of compuing one efficienly h een open for mny yer. We preen n exc lgorihm for hi prolem whoe running ime i rongly polynomil in he inpu plu oupu ize of he prolem. 1. Inroducion In ypicl evcuion iuion, he mo imporn k i o ge people ou of n endngered uilding or re f poile. Since i i uully no known how long uilding cn wihnd fire efore i collpe or how long dm cn rei flood efore i rek, i i dvile o orgnize n evcuion uch h much poile i ved no mer when he inferno will cully hppen. In he more rc eing of nework flow over ime, he ler requiremen i cpured y o-clled erlie rrivl flow. Before we dicu hi in more deil, we fir give hor nd decripive inroducion ino flow over ime. Thi work w uppored y DFG Focu Progrm 116, Algorihmic Apec of Lrge nd Complex Nework, grn no. SK 58/4-1 nd SK 58/5-3. Flow over ime. We conider nework N = (V,A) wih cpciie u e 0 nd rni ime τ e 0 on he rc e A. The cpciy of n rc ound he flow re (i.e., flow per ime) which flow cn ener he rc. The rni ime of n rc pecifie he moun of ime i ke for flow o rvel from he il o he hed of he rc. Moreover, here i e of ource node S + V nd e of ink node S V \ S +. Ech ource S + h upply v() > 0 nd ech ink S demnd v() > 0 uch h w S + S v(w) =0. A flow over ime 1 pecifie for ech rc e nd ech poin in ime he flow re which flow ener he rc (nd leve he rc gin τ e ime uni ler). Flow conervion conrin require h every poin in ime nd for every inermedie node w V \ (S + S ) he flow enering nd leving node w mu cncel ou ech oher. Flow over ime hve een inroduced y Ford nd Fulkeron [8] (ee lo [9]). Given nework wih ingle ource node, ingle ink node, nd ime horizon θ 0, hey conider he prolem of ending much flow poile from o wihin ime θ. I urn ou h mximl --flow over ime cn e deermined y ic min-co flow compuion where rni ime of rc re inerpreed co coefficien. Ford nd Fulkeron [8] lo inroduce he concep of ime-expnded nework h coni of one copy of he node e of he given nework for ech ime uni (we cll uch copy ime lyer). For ech rc e of he originl nework wih rni ime τ e he imeexpnded nework conin copie connecing ny wo ime lyer dince τ e. For more deil, we refer o [8, 5]. On he poiive ide, mo flow over ime prolem cn e olved y ic flow compuion in 1 There exi wo differen u cloely reled model for flow over ime dicree nd coninuou model. We conider he coninuou model u he preened reul lo hold in he dicree model. For more deil on hi iue we refer o [7]. In order o diinguih hem from flow over ime, we refer o clicl nework flow lo ic flow. 1
2 ime-expnded nework. On he negive ide, imeexpnded nework re huge in heory nd in prcice. In priculr, he ize of ime expnded nework i liner in he given ime horizon θ nd herefore exponenil (u ill peudopolynomil) in he inpu ize. Hoppe nd Trdo [15] conider he quicke rnhipmen prolem which i defined follow. Given nework wih everl ource nd ink node wih given upplie nd demnd, find flow over ime wih miniml ime horizon θ h ifie ll upplie nd demnd. Hoppe nd Trdo give rongly polynomil lgorihm for hi prolem. They preen heir reul for he dicree ime model. Fleicher nd Trdo [7] how h i lo hold in he coninuou ime model. Erlie rrivl flow re moived y pplicion reled o evcuion. In he conex of emergency evcuion from uilding, Berlin [1] nd Chlme e l. [3] udy he quicke rnhipmen prolem in nework wih muliple ource nd ingle ink. Jrvi nd Rliff [19] 3 how h hree differen ojecive of hi opimizion prolem cn e chieved imulneouly: (1) Minimizing he ol ime needed o end he upplie of ll ource o he ink, () fulfilling he erlie rrivl propery, nd (3) minimizing he verge ime for ll flow needed o rech he ink. Hmcher nd Tufecki [13] udy n evcuion prolem nd propoe oluion which furher preven unnecery movemen wihin uilding. Erlie rrivl flow. Shorly fer Ford nd Fulkeron inroduced flow over ime, he more elore --erlie rrivl flow prolem w udied y Gle [10]. Here he gol i o find ingle --flow over ime h imulneouly mximize he moun of flow reching he ink up o ny ime θ 0. A flow over ime fulfilling hi requiremen i id o hve he erlie rrivl propery nd i clled erlie rrivl flow. Gle [10] howed h --erlie rrivl flow lwy exi. Miniek [6] nd Wilkinon [31] oh gve peudopolynomil-ime lgorihm for compuing erlie rrivl flow ed on he Succeive Shore Ph Algorihm [0, 16, ]. Hoppe nd Trdo [14] preen fully polynomil ime pproximion cheme for he erlie rrivl flow prolem h i ed on clever cling rick. In nework wih everl ource nd ink wih given upplie nd demnd, flow over ime hving he erlie rrivl propery do no necerily exi [4]. We give imple counerexmple wih one ource nd wo ink in Figure 1. For he ce of everl ource wih given upplie nd ingle ink, however, erlie rrivl flow do lwy exi [7]. Thi follow, for exmple, from he exience of lexicogrphiclly mximl flow in imeexpnded nework; ee, e.g., [6]. We refer o hi prolem he erlie rrivl rnhipmen prolem. Hjek nd Ogier [1] give he fir polynomil ime lgorihm for he erlie rrivl rnhipmen prolem wih zero rni ime. Fleicher [4] give n lgorihm wih improved running ime. Fleicher nd Skuell [6] ue condened ime-expnded nework o pproxime he erlie rrivl rnhipmen prolem for he ce of rirry rni ime. They give n FP- TAS h pproxime he ime dely follow: For every ime θ 0 he moun of flow h hould hve reched he ink in n erlie rrivl rnhipmen y ime θ, reche he ink le ime (1+ε)θ. Tjndr [30] how how o compue erlie rrivl rnhipmen in nework wih ime dependen upplie nd cpciie in ime polynomil in he ime horizon nd he ol upply ource. The reuling running ime i hu only peudopolynomil in he inpu ize. Our conriuion. While i h previouly een oerved h erlie rrivl rnhipmen exi in he generl muliple-ource ingle-ink eing, he prolem of compuing one efficienly h een open. All previou lgorihm rely on ime expnion of he nework ino exponenilly mny ime lyer. We olve hi open prolem nd preen n efficien lgorihm which, in priculr, doe no rely on ime expnion. Uing necery nd ufficien crierion for he feiiliy of rnhipmen over ime prolem y Klinz [1], we fir recurively conruc he erlie rrivl pern, h i, he piece-wie liner funcion h decrie he ime-dependen mximum flow vlue. Our lgorihm employ umodulr funcion minimizion wihin he prmeric erch frmework of Megiddo [4, 5]. A y-produc, we preen new proof for he exience of erlie rrivl flow h doe no rely on ime expnion. We finlly how how o urn he erlie rrivl pern ino n erlie rrivl flow ed on he quicke rnhipmen lgorihm of Hoppe nd Trdo [15]. The running ime of our lgorihm i polynomil in he inpu ize plu he numer of rekpoin of he erlie rrivl pern. Since he erlie rrivl pern i more or le explicily pr of he oupu of he erlie rrivl rnhipmen prolem, we cn y h he running ime of our lgorihm i polynomilly ounded in he inpu plu oupu ize. Ouline. In he nex ecion we e necery nd ufficien crierion for he feiiliy of rnhipmen over ime prolem nd pply i o our eing. In Secion 3 we give n in-deph nlyi of he rucure of he erlie rrivl pern nd preen recurive lgorihm o compue i. How o compue he cul erlie rrivl rnhipmen ou of he pern i finlly howninsecion4. 3 Sricly peking, Jrvi nd Rliff [19] only conider he ingle-ource ce u heir oervion lo pplie o he more generl ce wih muliple ource.
3 1 v() = τ =0 τ =0 v( 1)= 1 τ =1 v( )= 1 Figure 1. A nework wih one ource nd wo ink wih uni demnd for which n erlie rrivl flow doe no exi. All rc hve uni cpciy nd he rni ime re given in he drwing. Noice h one uni of flow cn rech ink 1 y ime 1; in hi ce, he econd uni of flow reche ink only y ime 3. Alernively we cn end one uni of flow ino ink 1 nd imulneouly y ime. Bu here doe no exi n erlie rrivl flow where oh flow uni mu hve reched heir ink y ime nd one of hem mu hve lredy rrived ime 1.. Preliminrie We conider nework wih cpciie nd rni ime on he rc, ource node S + nd ink node S wih upplie nd demnd v : S + S R. We mke ue of he following reul of Klinz [1] (ee lo [7]). Lemm.1 (Klinz [1]). For θ 0 nd X S + S le v(x) := w X v(w) nd le o θ (X) e he mximl moun of flow h cn e en from he ource S + X o he ink S \ X wihin ime θ (ignoring upplie nd demnd). There exi flow over ime wih ime horizon θ h ifie ll upplie nd demnd if nd only if o θ (X) v(x) for ll X S + S. For θ 0 nd X S + S,hevlueo θ (X) cn e oined y ic min-co flow compuion. Conider he exended nework N defined follow. Sring from N, inroduce uper ource h i conneced o ll ource S + X y n uncpcied rc wih rni ime zero nd uper ink h cn e reched from ll ink S \ X y uch n rc. By conrucion of N,hevlueo θ (X) i equl o he vlue of mximl --flow over ime in N wih ime horizon θ. Furher exend N y dding n uncpcied dummy rc from o. I follow from he work of Ford nd Fulkeron [8] h o θ (X) = min { co θ (x) x circulion in N }. (1) Here, co θ (x) denoe he co of circulion x where rni ime on rc re inerpreed co coefficien nd he co coefficien of dummy rc (, ) i θ. A conequence of (1), he funcion θ o θ (X) i he co funcion of prmeric min-co flow prolem. A uch, i i piecewie liner nd convex. Bed on he work of Megiddo [3], Hoppe nd Trdo [15] oerve h he funcion o θ : S + S R i umodulr, h i, o θ (X)+o θ (Y ) o θ (X Y )+o θ (X Y ) for ll X, Y S + S. In he following we reric o nework wih ingle ink. The erlie rrivl pern p : R + R + i defined y eing p(θ) o he mximl moun of flow h cn e en ino he ink y ime θ wihou violing upplie he ource. An erlie rrivl rnhipmen i flow over ime uch h p(θ) uni of flow hve rrived he ink y ime θ for ll θ 0 imulneouly. For he ce of ingle ource S + = {} wih unounded upply, he --erlie rrivl pern i p(θ) =o θ ({}) nd hu piecewie liner nd convex. For he ce of everl ource, he erlie rrivl pern p i ill piecewie liner (ee Corollry.3 elow) u no necerily convex. A imple exmple wih wo ource i given in Figure. Noice h in hi exmple he re of flow rriving he ink (i. e., he derivive of p) uddenly decree ince he enire upply of ource 1 h rrived nd hi ource h herefore run empy. In Secion 3 we will oerve hi effec in more generl conex. The following lemm i eenilly reformulion of Lemm.1 for he eing of erlie rrivl rnhipmen nd will ler urn ou o e ueful. The proof i echnicl nd will e conined in he full verion of he pper. Lemm.. Le θ, q 0. Thenp(θ) q if nd only if o θ (S ) q v(s + \ S ) for ll S S +. () A conequence of Lemm., we cn how h he erlie rrivl pern i piecewie liner funcion. Corollry.3. The erlie rrivl pern p i piecewie liner.
4 flow vlue v( 1)= v( )= 1 3 ime Figure. A imple exmple of grph wih wo ource, uni cpciie, nd uni rni ime where he opiml rrivl pern of feile erlie rrivl rnhipmen i piecewie liner nd non-convex. Proof. A reul of Lemm. we ge p(θ) = min{o θ (S )+v(s + \ S ) S S + }. Since θ o θ (S ) i piecewie liner (nd convex) funcion for ll S S +, he reul follow. In he nex ecion we how how we cn deermine he erlie rrivl pern of he erlie rrivl rnhipmen prolem. The erlie rrivl rnhipmen ielf cn hen e oined from he given erlie rrivl pern hown in Secion Conrucing he erlie rrivl pern Throughou hi ecion we ue he following exmple innce o illure he preened ide nd echnique. Exmple. Aume we re given nework on he lef hnd ide in Figure 3 wih uni rni ime nd uni cpciie. The upplie of he ource re given in he picure The rucure of he erlie rrivl pern We how h he erlie rrivl pern p i compoed of everl --erlie rrivl pern in exended nework wih n ddiionl uperource h i conneced o cerin ue of ource in S +. We r y conidering he exended nework N 0 h rie from connecing uperource o ll node in S + y n uncpcied, zero rni ime rc. The node in S + re no longer ource u ke he role of inermedie node in N 0 nd heir ol upply v(s + ) i hifed o he uperource. Thu, feile -flow over ime in he exended nework N 0 induce flow over ime in N where v(s + ) uni of flow re eing en from he ource in S + o ink. Noice, however, h he induced flow over ime in N migh viole individul upplie he ource node. The --erlie rrivl pern in N 0 i he funcion θ o θ (S + ).Foreveryθ 0 i hold h p(θ) o θ (S + ).Ifp(θ) =o θ (S + ) for ll θ 0, we re done ince we know how o oin he --erlie rrivl pern θ o θ (S + ). Oherwie, le θ 1 := up{θ p(θ) = o θ (S + )}. 4 We ue he following lemm o prove h p(θ) =o θ (S + ) for ll 0 θ θ 1. Lemm 3.1. Le S S S + nd 0 θ θ. Then, o θ (S ) o θ (S ) o θ (S ) o θ (S ). Proof. Conider n exended nework N wih n ddiionl ink h cn e reched from hrough n uncpcied rc (, ) wih rni ime θ θ.the underlying inuiion i h ll flow rriving efore ime θ cn e forwrded o he new ink where i rrive efore ime θ. For S S + {, } le ō θ ( S) denoe he mximum moun of flow h cn e en from he ource in S o he ink in (S + {, }) \ S y ime θ. By conrucion of N we ge for S S + he following equliie: ō θ ( S) = o θ ( S) nd ō θ ( S {}) = o θ ( S). (3) We cn now prove he emen of he lemm. By (3) nd umodulriy of ō θ ( ) we ge o θ (S ) o θ (S ) = ō θ (S {}) ō θ (S {}) ō θ (S ) ō θ (S ) = o θ (S ) o θ (S ). Thi conclude he proof. Corollry 3.. Le θ 1 =mx{θ p(θ) =o θ (S + )}. Then p(θ) =o θ (S + ) for ll 0 θ θ 1. Proof. Aume y conrdicion h p(θ) <o θ (S + ) for ome 0 θ < θ 1. By Lemm. here exi S S + wih o θ (S ) < o θ (S + ) v(s + \ S ). I follow from Lemm 3.1 h o θ1 (S ) < o θ1 (S + ) v(s + \ S ) uch h p(θ 1 ) <o θ1 (S + ) y Lemm.. Thi conrdic he choice of θ 1. 4 The upremum here i indeed mximum ince p(θ) nd o θ (S + ) re oh coninuou funcion of θ.
5 flow vlue o θ ({ 1,, 3}) 8 v( 1 1)=1 v( )=1 v() = v( 3 3)= ime θ Figure 3. Exmple of nework N =(V,A), he nework expnded y uperource, nd he correponding --erlie rrivl pern. Exmple. In order o compue he --erlie rrivl pern for he nework given in he lef pr of Figure 3 we iner uperource depiced in he middle pr of Figure 3. Applying he Succeive Shore Ph Algorihm o hi nework yield, for exmple, he wo ph P 1 = (, 1,,) nd P = (, 3,,,), oh wih flow re 1. The reuling rrivl pern up o ime 6 i given in he righ pr of Figure 3. Noice h he flow rriving ink node fer ime 3 viole he upply of node 1 ince more hn one uni of flow h een en hrough ph P 1. On he oher hnd i cn eily e een h we cn reroue he flow gining ph decompoiion wih P 1 = (, 3,,), P = (, 1,,,), nd P 3 = (,,,,) where he flow re on ph P 1 i 1 nd he flow re on ph P nd P 3 re only 1/. Noice h he flow rriving over hee ph he ink doe no viole upplie up o ime 5 nd h ill he me rrivl pern. Furher, here i no oher wy of ending flow oeying he upplie of ource 1,, 3 for longer hn 5 ime uni. Afer ime 5 he lope of he erlie rrivl pern p decree ince no more flow ou of ource 1 nd cn rech he ink. In priculr, he vlue of θ 1 equl 5. In our exmple, ny flow over ime in N h end p(θ 1 ) uni ino he ink y ime θ 1 mu ue up he upplie of ource 1 nd.inoherword, he ounded upplie of hee ource re he reon why p(θ) < o θ (S + ) for θ > θ 1. The nex lemm illumine hi effec for generl innce. Lemm 3.3. There exi ue of ource S 1 S + uch h o θ1 (S 1 ) = o θ1 (S + ) v(s + \ S 1 ). Before we prove he lemm, we fir give n inuiive inerpreion of i emen. In n erlie rrivl rnhipmen, p(θ 1 ) = o θ1 (S + ) uni of flow rech he ink y ime θ 1. The lemm e h mo o θ1 (S + ) v(s + \ S 1 ) of hee uni cn origine from ource in S 1. The remining v(s + \ S 1 ) uni mu origine from ource in S + \ S 1.Thee ource herefore run empy nd cnno conriue o flow rriving fer ime θ 1 he ink. Proof. By conrdicion ume h o θ1 (S ) > o θ1 (S + ) v(s + \ S ) for ll S S +. Since o θ (S ) nd o θ (S + ) re coninuou funcion of θ, here exi ɛ>0 uch h o θ1+ɛ (S ) o θ1+ɛ (S + ) v(s + \ S ) for ll S S +. By Lemm. hi implie p(θ 1 + ɛ) o θ1+ɛ (S + ). Thi conrdic he choice of θ 1. We conider he reduced innce of he erlie rrivl rnhipmen prolem h i oined y eing he upplie of ll ource in S + \ S 1 o zero. The erlie rrivl pern of he modified innce i denoed y p. The following heorem i he min reul of hi ecion. Theorem 3.4. Le θ 1 =mx{θ p(θ) =o θ (S + )} nd S 1 S + uch h o θ1 (S 1 )=o θ1 (S + ) v(s + \ S 1 ) (ee Lemm 3.3). Le p denoe he erlie rrivl pern of he modified innce wih ource e S 1. Then, { o θ (S + ) if θ<θ 1, p(θ) = p (θ)+v(s + \ S 1 ) if θ θ 1. A reul of Theorem 3.4, we hve reduced he prolem of conrucing he erlie rrivl pern p o he prolem of compuing n --erlie rrivl pern nd compuing n erlie rrivl pern for mller numer of ource S 1. Proof. I follow from Corollry 3. h p(θ) = o θ (S + ) for θ θ 1. I remin o how h p(θ) = p (θ)+v(s + \ S 1 ) for ll θ θ 1. I i cler h hold ince y ime θ mo p (θ) nd v(s + \ S 1 ) uni of flow cn rech he ink origining from ource in S 1 nd S + \ S 1, repecively.
6 I remin o how h hold, h i, p (θ) + v(s + \ S 1 ) uni of flow cn e en ino he ink y ime θ θ 1 wihou exceeding upplie he ource. We check he condiion given in Lemm.. For S S + nd θ θ 1 we ge y umodulriy of o θ ( ): o θ (S ) o θ (S S 1 )+o θ (S S 1 ) o θ (S 1 ) y Lemm 3.1: o θ (S S 1 )+o θ1 (S S 1 ) o θ1 (S 1 ) y Lemm. nd Lemm 3.3: ( ) p (θ) v(s 1 \ S ) + (o θ1 (S + ) v ( S + \ (S S 1 ) )) ( ) o θ1 (S + ) v(s + \ S 1 ) = p (θ) v(s 1 \ S ) v ( S + \ (S S 1 ) ) + v(s + \ S 1 ) = p (θ) v(s + \ S )+v(s + \ S 1 ). The reul now follow from Lemm.. Exmple. For our exmple given in Figure 3 we hve lredy een h up o ime θ 1 = 5 flow of vlue 5 including he ol upply of he ource 1 nd cn e en ino he ink. In priculr, i hold h o θ (S ) o θ (S + ) v(s + \ S ) for ll S S + nd θ θ 1. For he e S 1 := { 3 } S + nd θ = θ 1 hi inequliy i igh. The funcion θ o θ (S + ) i lredy known (ee he righ pr of Figure 3). For he rericed erlie rrivl prolem wih ource S 1 = { 3 }, he erlie rrivl pern p i given in he lef pr of Figure 4. By Theorem 3.4, he reuling erlie rrivl pern p of he originl innce i he lower envelop of he wo funcion depiced in he righ pr of Figure Compuing he erlie rrivl pern Wih Theorem 3.4 we hve reduced he prolem of compuing he erlie rrivl pern o n -erlie rrivl flow prolem nd n erlie rrivl rnhipmen prolem on reduced innce wih ricly mller e of ource. Applying hi reul recurively o he reduced innce finlly yield Algorihm 1 which compue he erlie rrivl pern p. For he undernding of he lgorihm i i helpful o oerve h θ i <θ i+1 for ll i 0. The emen i cler for i =0ince he ource in S + \ S 1 Algorihm 1: Compuing he erlie rrivl pern. Inpu: (G, S +,) Oupu: Erlie rrivl pern p. 1 e i := 0, S i := S +,ndθ i := 0; while S i do 3 compue he mximl vlue θ i+1 0 uch h o θ i+1 (S ) o θ i+1 (S i) v(s i \ S ) for ll S S i; 4 compue n incluion-wie miniml S i+1 S i wih o θ i+1 (S i+1) = o θ i+1 (S i) v(s i \ S i+1) ; (4) 5 compue he funcion θ o θ (S i) on he inervl [θ i,θ i+1) nd e p(θ) :=o θ (S i)+v(s + \ S i) for θ [θ i,θ i+1); 6 i := i +1; 7 e p(θ) :=v(s + ) for ll θ θ i; hve poiive upply nd herefore cnno run empy ime θ 0 =0. For i 1 ume y conrdicion h θ i+1 θ i. Thi yield y Lemm 3.1: o θi (S i+1 ) o θi (S i )+o θi+1 (S i+1 ) o θi+1 (S i ) y (4): y (4) wih i := i 1: = o θi (S i ) v(s i \ S i+1 ) = o θi (S i 1 ) v(s i 1 \ S i ) v(s i \ S i+1 ) = o θi (S i 1 ) v(s i 1 \ S i+1 ) which conrdic he miniml choice of S i S i+1 in ep 4 of he lgorihm. Theorem 3.5. Algorihm 1 compue he erlie rrivl pern nd cn e implemened o run in rongly polynomil ime in he inpu plu oupu ize. In order o prove hi heorem, we need he following echnicl lemm which give ound on he compuionl complexiy of ep 5. Lemm 3.6. For 0 θ i θ i+1 nd S S +, he piecewie liner funcion g : [θ i,θ i+1 ) R wih g(θ) :=o θ (S ) cn e compued in ime polynomil in he inpu ize plu he numer of rekpoin. Proof. In order o compue g(θ) =o θ (S ), we conider he exended nework N h i oined follow. Add uperource h i conneced o ll ource in S y n uncpcied rc wih rni ime zero nd h cn e reched from y n uncpcied dummy rc (, ). A lredy ed in (1), g(θ) i equl o he co of min-co circulion in N
7 flow vlue p(θ) flow vlue p (θ) ime θ ime θ Figure 4. Opiml pern p for he prolem wih he reduced e of ource S 1 (lef) nd he comined pern p he lower ound of he line egmen (righ). where he co coefficien of he dummy rc (, ) i e o τ (,) = θ. We denoe he co of n rirry circulion x in hi nework y co θ (x). We r y compuing min-co circulion x in N for θ = θ i. Le N x denoe he reidul nework of x nd le θ e he lengh of hore -ph in N x. Since here i he uncpcied dummy rc (, ) of co θ i in N x, opimliy of x implie θ θ i. Moreover, for ll θ [θ i,θ ],hecirculion x i ill min-co circulion nd g(θ) = co θ (x). Since he co of x depend linerly on θ, he funcion g i hu liner on he inervl [θ i,θ ]. If θ θ i+1, hen we re done. Oherwie we hve dicovered rekpoin of g θ. Noice h x i no longer opiml for θ>θ ince he co cn e reduced y ugmening flow on negive cycle formed y hore --ph of lengh θ in N x nd he dummy rc (, ) of lengh θ. We oin he nex liner piece of g ring θ follow. Compue he unework N x of he reidul nework N x h i formed y ll rc h lie on ome hore --ph. Compue mximum --flow in N x nd urn i ino circulion y in N x y ending ll flow from ck o on he dummy rc (, ). Augmening x ccording o y yield new circulion x. The new circulion i opiml for ll θ [θ,θ ] where θ >θ i he lengh of hore --ph in he new reidul nework N x nd deermine he nex rekpoin of g. The decried proce i iered unil he lengh of hore --ph in he reidul nework i le θ i+1. Noice h he overll running ime i domined y he iniil min-co flow compuion plu numer of rekpoin mny mx-flow compuion. Exmple. In our exmple depiced in Figure 3 we cn find he funcion g : [θ i,θ i+1 ) R decried ove. For he inervl [θ 0,θ 1 ) we ge he nework N,N x, nd N x follow. Nework N i conruced y dding uperource conneced o ll ource y uncpcied, zero rni ime rc nd n uncpcied rc (, ) wih rni ime τ (,) =. Thi i depiced in Figure 5.1. In hi nework we compue min-co (mximum flow) circulion y ending one uni of flow for exmple over cycle,,,,. Thi yield he reidul nework N x which i depiced in Figure 5.. There he hore -ph, for exmple ph, 3,,,, h lengh θ =3. In he unework N x coniing of ll rc eing pr of ome hore --ph we now compue mximum --flow. Such ph flow, 1,,, i depiced in Figure 5.3. Reconidering nework N x ogeher wih new circulion of one uni of flow long cycle, 1,,,, reul in he new reidul nework N x(new) which i depiced in Figure 5.4. There no (hore) --ph remin nd herefore he rni ime of rc (, ) i e o infiniy which i ricly greer hn θ 1. Thu we hve found funcion g on he inervl [θ 0,θ 1 ) which i of he form hown in Figure 5.5. Proof of Theorem 3.5. The correcne of he lgorihm follow from Secion 3.1 nd in priculr from Theorem 3.4. I hu remin o prove he ed ound on he running ime. Fir noice h he numer of ierion of he while-loop in ep i ounded y he numer of ource ince le one ource i elimined from S i in every ierion. Since ep 5 cn e done in rongly polynomil ime, i remin o how h ep 3 nd 4 cn lo e done in rongly polynomil ime. We r wih he compuion of θ i+1 in ep 3. For θ 0 we define he funcion f θ : Si R y f θ (S ):=o θ (S ) o θ (S i )+v(s i \ S ) for S S i. Compuing θ i+1 hu moun o finding he mximl vlue θ 0 uch h f θ (S ) 0 for ll S S i. (5) Since o θ i umodulr nd he funcion S v(s i \ S ) o θ (S i )
8 1.) N τ (,) = θ 0 =.) N x τ (,) = θ 0 = ) N x 4.) N x (new) τ (,) = θ 0 = ) co θ (x) θ 0 =θ =3 θ 1 =5 ime Figure 5. Nework ued o compue he funcion g :[θ 0,θ 1 ) R decried in he proof of Lemm 3.6 for he exmple given in Figure 3. i modulr, f θ i umodulr. According o (1), compuing f θ (S ) for ome S S i require wo minco flow compuion where he co coefficien depend linerly on he prmeer θ. I w hown y Gröchel, Lováz, nd Schrijver [11] h here i rongly polynomil lgorihm for minimizing umodulr funcion 5. I cn herefore e eed in rongly polynomil ime wheher (5) i fulfilled for fixed vlue θ. Emedding hi lgorihm ino Megiddo prmeric erch frmework (ee [4, 5]) give procedure for ep 3 whoe running ime i rongly polynomil in he inpu ize of our prolem (more deil cn e found in [15]). We finlly dicu how o compue S i+1 in ep 4 in rongly polynomil ime. Noice h (4) rnle o f θi+1 (S i+1 ) = 0,hi,S i+1 minimize he umodulr funcion f θi+1. By umodulriy of f θi+1, here exi unique incluion-wie miniml ue S i+1 which cn e oined follow 6 (ee, e.g., [9, Chper 45]). Iniilize S i+1 := S i. For ech S i, check wheher he minimum vlue 5 Cominoril lgorihm chieving rongly polynomil running ime re given y Iw, Fleicher, nd Fujihige [18] nd y Schrijver [8]. A fully cominoril lgorihm i given y Iw [17]. 6 For he purpoe of our lgorihm i i of coure dvngeou o chooe he miniml ue S i+1 in order o reduce he numer of ource fr poile. of f θi+1 over ll ue of S i+1 \{} i zero. If o, ree S i+1 := S i+1 \{}. Doing hi for ll elemen of S i finlly yield he unique incluion-wie miniml ue S i+1 wih f θi+1 (S i+1 )=0.Afer lgorihm for compuing he incluion-wie miniml ue S i+1 w recenly given y McCormick nd Queyrnne []. 4. Turning he erlie rrivl pern ino n erlie rrivl rnhipmen In hi ecion we ume h we re given he piecewie liner erlie rrivl pern p of he erlie rrivl rnhipmen prolem y i rekpoin (x 0,f 0 ), (x 1,f 1 ),...,(x k,f k ),hi, 0 if θ x 0, if x i θ, p(θ) = f i + θ xi x i+1 x i (f i+1 f i ) θ x i+1, 0 i<k, f k if θ x k. An illurion i given in Figure 6. Noice h he vlue x i deermine poin in ime nd he vlue f i deermine n moun of flow for ll i. Furher noice h x 0 <x 1 < <x k
9 flow vlue p(θ) (f 1 f 0) f 6 f 5 x 6 x 1 x 6 x x 6 x 3 (f f 1) (f 3 f ) f 4 f 3 x 6 x 4 x 6 x 5 (f 4 f 3) f f 1 x 6 x 6 (f 5 f 4) x 0 x 1x x 3 x 4 x 5 x 6 ime θ (f 6 f 5) Figure 6. On he lef hnd ide we drw he erlie rrivl pern p wih rekpoin (x i,f i ), i = 1,,...,k =6. On he righ hnd ide he modified nework i depiced. The cpciy of rc e i =(, i ) i e o (f i f i 1 )(x i x i 1 ). nd x 0 i he fir poin in ime when flow cn rech he ink (i. e., x 0 i he rni ime of hore ph leding from ny ource o he ink). Moreover, 0=f 0 f 1 f k = v(s + ). We how h he prolem of finding n erlie rrivl rnhipmen cn e reduced o finding rnhipmen over ime in lighly modified nework N wih k ddiionl rc leding from o k new ink node 1,..., k. An illurion of he modificion i given in Figure 6. Node i no longer ink u ju n inermedie node of he modified nework N. For i =1,...,k, he demnd of ink i i e o (f i f i 1 ) uch h he ol demnd f k of he ink nd he ol upply v(s + ) he ource cncel ou ech oher. The rc leding from o ink i i clled e i. The rni ime of rc e i i defined o e τ ei := x k x i, i cpciy i (f i f i 1 )/(x i x i 1 ) nd hu equl o he derivive of p wihin he inervl [x i 1,x i ]. Noice h he cpciy of e i i choen uch h he demnd of ink i i fulfilled if flow i eing en mximl re ino rc e i wihin ime inervl [x i 1,x i ). A conequence of hi oervion, we cn e he following lemm. Lemm 4.1. An erlie rrivl flow in N wih erlie rrivl pern p nurlly induce feile rnhipmen over ime wih ime horizon x k ifying ll upplie nd demnd in N Proof. Tke n erlie rrivl flow in N nd urn i ino rnhipmen over ime in N y ending ll flow rriving in ime inervl [x i 1,x i ) o i long rc e i. The revere direcion of Lemm 4.1 lo hold. Due o pce limiion, we omi hi proof in hi exended rc. I will e conined in he full verion of he pper. Lemm 4.. A rnhipmen over ime wih ime horizon x k h ifie ll upplie nd demnd in he modified nework N nurlly induce n erlie rrivl rnhipmen in N. We finlly prove h rnhipmen over ime wih ime horizon x k h ifie ll upplie nd demnd in he modified nework N cully exi. A conequence of Lemm 4., hi yield new proof for he exience of n erlie rrivl rnhipmen in N. Lemm 4.3. There exi rnhipmen over ime wih ime horizon x k ifying ll upplie nd demnd in N. Proof. We denoe he e of ource in N y S + nd he e of ink y S = { 1,..., k }. For n rirry S S + S le ō θ (S ) denoe he mximum moun of flow h cn e en wihin ime θ from ource S + S o ink S \ S. By Lemm.1 we hve o how h ō θ (S ) v(s ) for θ = x k. Le o θ (S + S ) denoe he mximum moun of flow h cn e en wihin ime θ from ource S + S o. By Lemm 3.1 we ge o θ (S + S )+v(s + \ S ) p(θ) for ll θ 0. Thi inequliy cn e inerpreed follow: If we ume h he ol upply v(s + \ S ) of he ource S + \ S i lredy in from ime zero on, hen we cn end v(s + S ) ddiionl flow uni from he ource in S + S (ignoring heir individul upplie) ino uch h he moun of flow i le p(θ) ny ime θ 0. By forwrding flow from o he ink in S (imilr o he proof of Lemm 4.1), we ge flow over ime wih ime horizon x k h ifie he demnd of ll ink in S. From hi flow over ime we now remove he v(s + \ S ) flow uni h we umedoein ime zero. Thi yield flow over ime wih ime horizon x k from he ource in S + S
10 o he ink S uch h he ol moun of flow en i v(s + S ) ndnoinkins ge more hn i demnd. Therefore he flow rriving ink in S \ S i le v(s + S )+v(s S )=v(s ). We hve hu hown h ō θ (S ) v(s ) for θ = x k.thi conclude he proof. A conequence we cn e he following heorem. Theorem 4.4. Given he erlie rrivl pern p wih k rekpoin for nework N, n erlie rrivl rnhipmen in N cn e oined y compuing rnhipmen over ime in modified nework N wih k ddiionl node nd rc. In order o compue rnhipmen over ime in he modified nework N we cn ue he lgorihm of Hoppe nd Trdo [15]. Since he running ime of hi lgorihm i ounded y polynomil in he encoding ize of he inpu N nd ince he encoding ize of N i of he me order he encoding ize of N plu he encoding ize of p, he required running ime i polynomil in he inpu plu oupu ize of he erlie rrivl flow prolem on N. Acknowledgemen. The uhor wn o hnk Li Fleicher, Bein Klinz, nd Ekkehrd Köhler for inereing nd helpful dicuion on he opic of hi pper. Reference [1] G. N. Berlin. The ue of direced roue for eing ecpe poenil. Nionl Fire Proecion Aociion, Boon, MA, [] R. G. Buker nd P. J. Gowen. A procedure for deermining miniml-co nework flow pern. Technicl Repor 15, Operionl Reerch Office, John Hopkin Univeriy, Blimore, MD, [3] L. G. Chlme, R. L. Frnci, nd P. B. Sunder. Nework model for uilding evcuion. Mngemen Science, 8:86 105, 198. [4] L. K. Fleicher. Fer lgorihm for he quicke rnhipmen prolem. SIAM Journl on Opimizion, 1:18 35, 001. [5] L. K. Fleicher nd M. Skuell. Quicke flow over ime. SIAM Journl on Compuing. To pper. [6] L. K. Fleicher nd M. Skuell. The quicke mulicommodiy flow prolem. In W. J. Cook nd A. S. Schulz, edior, Ineger Progrmming nd Cominoril Opimizion, volume 337 of Lecure Noe in Compuer Science, pge Springer, Berlin, 00. [7] L. K. Fleicher nd É. Trdo. Efficien coninuouime dynmic nework flow lgorihm. Operion Reerch Leer, 3:71 80, [8] L. R. Ford nd D. R. Fulkeron. Conrucing mximl dynmic flow from ic flow. Operion Reerch, 6: , [9] L. R. Ford nd D. R. Fulkeron. Flow in Nework. Princeon Univeriy Pre, Princeon, NJ, 196. [10] D. Gle. Trnien flow in nework. Michign Mhemicl Journl, 6:59 63, [11] M. Gröchel, L. Lováz, nd A. Schrijver. Geomeric Algorihm nd Cominoril Opimizion, volume of Algorihm nd Cominoric. Springer, Berlin, [1] B. Hjek nd R. G. Ogier. Opiml dynmic rouing in communicion nework wih coninuou rffic. Nework, 14: , [13] H. W. Hmcher nd S. Tifecki. On he ue of lexicogrphic min co flow in evcuion modeling. Nvl Reerch Logiic, 34: , [14] B. Hoppe nd É. Trdo. Polynomil ime lgorihm for ome evcuion prolem. In Proceeding of he 5h Annul ACM SIAM Sympoium on Dicree Algorihm, pge , Arlingon, VA, [15] B. Hoppe nd É. Trdo. The quicke rnhipmen prolem. Mhemic of Operion Reerch, 5:36 6, 000. [16] M. Iri. A new mehod of olving rnporionnework prolem. Journl of he Operion Reerch Sociey of Jpn, 6:7 87, [17] S. Iw. A fully cominoril lgorihm for umodulr funcion minimizion. Journl of Cominoril Theory, Ser. B, 84:03 1, 00. [18] S. Iw, L. Fleicher, nd S. Fujihige. A cominoril rongly polynomil lgorihm for minimizing umodulr funcion. Journl of he ACM, 48: , 001. [19] J. Jrvi nd H. Rliff. Some equivlen ojecive for dynmic nework flow prolem. Mngemen Science, 8: , 198. [0] P. A. Jewel. Opiml flow hrough nework. Technicl Repor 8, Operion Reerch Cener, MIT, Cmridge, MA, [1] B. Klinz. Cied peronl communicion (1994) in [15]. [] S. T. McCormick nd M. Queyrnne. Finding ll opiml oluion for umodulr funcion minimizion. Tlk given Oerwolfch workhop ID 0545 on Cominoril Opimizion, Novemer 005. [3] N. Megiddo. Opiml flow in nework wih muliple ource nd ink. Mhemicl Progrmming, 7:97 107, [4] N. Megiddo. Cominoril opimizion wih rionl ojecive funcion. Mhemic of Operion Reerch, 4:414 44, [5] N. Megiddo. Applying prllel compuion lgorihm in he deign of eril lgorihm. Journl of he ACM, 30:85 865, [6] E. Miniek. Mximl, lexicogrphic, nd dynmic nework flow. Operion Reerch, 1:517 57, [7] D. Richrdon nd É. Trdo. Cied peronl communicion (00) in [5]. [8] A. Schrijver. A cominoril lgorihm minimizing umodulr funcion in rongly polynomil ime. Journl of Cominoril Theory, Serie B, 80: , 000. [9] A. Schrijver. Cominoril Opimizion: Polyhedr nd Efficiency. Springer, Berlin, 003. [30] S. Tjndr. Dynmic Nework Opimizion wih Applicion o he Evcuion Prolem. PhD hei, Univeriä Kierluern, Shker Verlg, Achen, 003. [31] W. L. Wilkinon. An lgorihm for univerl mximl dynmic flow in nework. Operion Reerch, 19: , 1971.
Positive and negative solutions of a boundary value problem for a
Invenion Journl of Reerch Technology in Engineering & Mngemen (IJRTEM) ISSN: 2455-3689 www.ijrem.com Volume 2 Iue 9 ǁ Sepemer 28 ǁ PP 73-83 Poiive nd negive oluion of oundry vlue prolem for frcionl, -difference
More informationBipartite Matching. Matching. Bipartite Matching. Maxflow Formulation
Mching Inpu: undireced grph G = (V, E). Biprie Mching Inpu: undireced, biprie grph G = (, E).. Mching Ern Myr, Hrld äcke Biprie Mching Inpu: undireced, biprie grph G = (, E). Mflow Formulion Inpu: undireced,
More information5. Network flow. Network flow. Maximum flow problem. Ford-Fulkerson algorithm. Min-cost flow. Network flow 5-1
Nework flow -. Nework flow Nework flow Mximum flow prolem Ford-Fulkeron lgorihm Min-co flow Nework flow Nework N i e of direced grph G = (V ; E) ource 2 V which h only ougoing edge ink (or deinion) 2 V
More informationMax-flow and min-cut
Mx-flow nd min-cu Mx-Flow nd Min-Cu Two imporn lgorihmic prolem, which yield euiful duliy Myrid of non-rivil pplicion, i ply n imporn role in he opimizion of mny prolem: Nework conneciviy, irline chedule
More informationLAPLACE TRANSFORMS. 1. Basic transforms
LAPLACE TRANSFORMS. Bic rnform In hi coure, Lplce Trnform will be inroduced nd heir properie exmined; ble of common rnform will be buil up; nd rnform will be ued o olve ome dierenil equion by rnforming
More informationProblem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.
CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex
More informationMax-flow and min-cut
Mx-flow nd min-cu Mx-Flow nd Min-Cu Two imporn lgorihmic prolem, which yield euiful duliy Myrid of non-rivil pplicion, i ply n imporn role in he opimizion of mny prolem: Nework conneciviy, irline chedule
More informationNetwork Flows: Introduction & Maximum Flow
CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch
More informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationCS4445/9544 Analysis of Algorithms II Solution for Assignment 1
Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he
More informationgraph of unit step function t
.5 Piecewie coninuou forcing funcion...e.g. urning he forcing on nd off. The following Lplce rnform meril i ueful in yem where we urn forcing funcion on nd off, nd when we hve righ hnd ide "forcing funcion"
More informationFlow Networks Alon Efrat Slides courtesy of Charles Leiserson with small changes by Carola Wenk. Flow networks. Flow networks CS 445
CS 445 Flow Nework lon Efr Slide corey of Chrle Leieron wih mll chnge by Crol Wenk Flow nework Definiion. flow nework i direced grph G = (V, E) wih wo diingihed erice: orce nd ink. Ech edge (, ) E h nonnegie
More informationCSC 373: Algorithm Design and Analysis Lecture 9
CSC 373: Algorihm Deign n Anlyi Leure 9 Alln Boroin Jnury 28, 2013 1 / 16 Leure 9: Announemen n Ouline Announemen Prolem e 1 ue hi Friy. Term Te 1 will e hel nex Mony, Fe in he uoril. Two nnounemen o follow
More informationGraduate Algorithms CS F-18 Flow Networks
Grue Algorihm CS673-2016F-18 Flow Nework Dvi Glle Deprmen of Compuer Siene Univeriy of Sn Frnio 18-0: Flow Nework Diree Grph G Eh ege weigh i piy Amoun of wer/eon h n flow hrough pipe, for inne Single
More informationSome basic notation and terminology. Deterministic Finite Automata. COMP218: Decision, Computation and Language Note 1
COMP28: Decision, Compuion nd Lnguge Noe These noes re inended minly s supplemen o he lecures nd exooks; hey will e useful for reminders ou noion nd erminology. Some sic noion nd erminology An lphe is
More informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationMaximum Flow. Flow Graph
Mximum Flow Chper 26 Flow Grph A ommon enrio i o ue grph o repreen flow nework nd ue i o nwer queion ou meril flow Flow i he re h meril move hrough he nework Eh direed edge i ondui for he meril wih ome
More informationMinimum Squared Error
Minimum Squred Error LDF: Minimum Squred-Error Procedures Ide: conver o esier nd eer undersood prolem Percepron y i > for ll smples y i solve sysem of liner inequliies MSE procedure y i = i for ll smples
More informationMinimum Squared Error
Minimum Squred Error LDF: Minimum Squred-Error Procedures Ide: conver o esier nd eer undersood prolem Percepron y i > 0 for ll smples y i solve sysem of liner inequliies MSE procedure y i i for ll smples
More informationContraction Mapping Principle Approach to Differential Equations
epl Journl of Science echnology 0 (009) 49-53 Conrcion pping Principle pproch o Differenil Equions Bishnu P. Dhungn Deprmen of hemics, hendr Rn Cmpus ribhuvn Universiy, Khmu epl bsrc Using n eension of
More informatione t dt e t dt = lim e t dt T (1 e T ) = 1
Improper Inegrls There re wo ypes of improper inegrls - hose wih infinie limis of inegrion, nd hose wih inegrnds h pproch some poin wihin he limis of inegrion. Firs we will consider inegrls wih infinie
More informationSolutions to assignment 3
D Sruure n Algorihm FR 6. Informik Sner, Telikeplli WS 03/04 hp://www.mpi-.mpg.e/~ner/oure/lg03/inex.hml Soluion o ignmen 3 Exerie Arirge i he ue of irepnie in urreny exhnge re o rnform one uni of urreny
More informationMain Reference: Sections in CLRS.
Maximum Flow Reied 09/09/200 Main Reference: Secion 26.-26. in CLRS. Inroducion Definiion Muli-Source Muli-Sink The Ford-Fulkeron Mehod Reidual Nework Augmening Pah The Max-Flow Min-Cu Theorem The Edmond-Karp
More information( ) ( ) ( ) ( ) ( ) ( y )
8. Lengh of Plne Curve The mos fmous heorem in ll of mhemics is he Pyhgoren Theorem. I s formulion s he disnce formul is used o find he lenghs of line segmens in he coordine plne. In his secion you ll
More information0 for t < 0 1 for t > 0
8.0 Sep nd del funcions Auhor: Jeremy Orloff The uni Sep Funcion We define he uni sep funcion by u() = 0 for < 0 for > 0 I is clled he uni sep funcion becuse i kes uni sep = 0. I is someimes clled he Heviside
More informationMotion. Part 2: Constant Acceleration. Acceleration. October Lab Physics. Ms. Levine 1. Acceleration. Acceleration. Units for Acceleration.
Moion Accelerion Pr : Consn Accelerion Accelerion Accelerion Accelerion is he re of chnge of velociy. = v - vo = Δv Δ ccelerion = = v - vo chnge of velociy elpsed ime Accelerion is vecor, lhough in one-dimensionl
More informationIX.1.1 The Laplace Transform Definition 700. IX.1.2 Properties 701. IX.1.3 Examples 702. IX.1.4 Solution of IVP for ODEs 704
Chper IX The Inegrl Trnform Mehod IX. The plce Trnform November 4, 7 699 IX. THE APACE TRANSFORM IX.. The plce Trnform Definiion 7 IX.. Properie 7 IX..3 Emple 7 IX..4 Soluion of IVP for ODE 74 IX..5 Soluion
More informationFlow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001
CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each
More informationThe solution is often represented as a vector: 2xI + 4X2 + 2X3 + 4X4 + 2X5 = 4 2xI + 4X2 + 3X3 + 3X4 + 3X5 = 4. 3xI + 6X2 + 6X3 + 3X4 + 6X5 = 6.
[~ o o :- o o ill] i 1. Mrices, Vecors, nd Guss-Jordn Eliminion 1 x y = = - z= The soluion is ofen represened s vecor: n his exmple, he process of eliminion works very smoohly. We cn elimine ll enries
More informationENGR 1990 Engineering Mathematics The Integral of a Function as a Function
ENGR 1990 Engineering Mhemics The Inegrl of Funcion s Funcion Previously, we lerned how o esime he inegrl of funcion f( ) over some inervl y dding he res of finie se of rpezoids h represen he re under
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationIntroduction to Congestion Games
Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game
More informationGraphs III - Network Flow
Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v
More informationMax Flow, Min Cut COS 521. Kevin Wayne Fall Soviet Rail Network, Cuts. Minimum Cut Problem. Flow network.
Sovie Rail Nework, Max Flow, Min u OS Kevin Wayne Fall Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming, :,. Minimum u Problem u Flow nework.! Digraph
More information1 Motivation and Basic Definitions
CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider
More information1 The Network Flow Problem
5-5/65: Deign & Anlyi of Algorihm Ooer 5, 05 Leure #0: Nework Flow I l hnged: Ooer 5, 05 In hee nex wo leure we re going o lk ou n imporn lgorihmi prolem lled he Nework Flow Prolem. Nework flow i imporn
More informationIX.1.1 The Laplace Transform Definition 700. IX.1.2 Properties 701. IX.1.3 Examples 702. IX.1.4 Solution of IVP for ODEs 704
Chper IX The Inegrl Trnform Mehod IX. The plce Trnform November 6, 8 699 IX. THE APACE TRANSFORM IX.. The plce Trnform Definiion 7 IX.. Properie 7 IX..3 Emple 7 IX..4 Soluion of IVP for ODE 74 IX..5 Soluion
More informationCS3510 Design & Analysis of Algorithms Fall 2017 Section A. Test 3 Solutions. Instructor: Richard Peng In class, Wednesday, Nov 15, 2017
Uer ID (NOT he 9 igi numer): gurell4 CS351 Deign & Anlyi of Algorihm Fll 17 Seion A Te 3 Soluion Inruor: Rihr Peng In l, Weney, Nov 15, 17 Do no open hi quiz ookle unil you re iree o o o. Re ll he inruion
More information5.1-The Initial-Value Problems For Ordinary Differential Equations
5.-The Iniil-Vlue Problems For Ordinry Differenil Equions Consider solving iniil-vlue problems for ordinry differenil equions: (*) y f, y, b, y. If we know he generl soluion y of he ordinry differenil
More information4.8 Improper Integrals
4.8 Improper Inegrls Well you ve mde i hrough ll he inegrion echniques. Congrs! Unforunely for us, we sill need o cover one more inegrl. They re clled Improper Inegrls. A his poin, we ve only del wih inegrls
More informationOptimality of Myopic Policy for a Class of Monotone Affine Restless Multi-Armed Bandit
Univeriy of Souhern Cliforni Opimliy of Myopic Policy for Cl of Monoone Affine Rele Muli-Armed Bndi Pri Mnourifrd USC Tr Jvidi UCSD Bhkr Krihnmchri USC Dec 0, 202 Univeriy of Souhern Cliforni Inroducion
More informationAdmin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t)
/0/ dmin lunch oday rading MX LOW PPLIION 0, pring avid Kauchak low graph/nework low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationCSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it
CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy
More information4/12/12. Applications of the Maxflow Problem 7.5 Bipartite Matching. Bipartite Matching. Bipartite Matching. Bipartite matching: the flow network
// Applicaion of he Maxflow Problem. Biparie Maching Biparie Maching Biparie maching. Inpu: undireced, biparie graph = (, E). M E i a maching if each node appear in a mo one edge in M. Max maching: find
More informationTransformations. Ordered set of numbers: (1,2,3,4) Example: (x,y,z) coordinates of pt in space. Vectors
Trnformion Ordered e of number:,,,4 Emple:,,z coordine of p in pce. Vecor If, n i i, K, n, i uni ecor Vecor ddiion +w, +, +, + V+w w Sclr roduc,, Inner do roduc α w. w +,.,. The inner produc i SCLR!. w,.,
More information18 Extensions of Maximum Flow
Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I
More informationAlgorithm Design and Analysis
Algorihm Deign and Analyi LECTURE 0 Nework Flow Applicaion Biparie maching Edge-dijoin pah Adam Smih 0//0 A. Smih; baed on lide by E. Demaine, C. Leieron, S. Rakhodnikova, K. Wayne La ime: Ford-Fulkeron
More informationf t f a f x dx By Lin McMullin f x dx= f b f a. 2
Accumulion: Thoughs On () By Lin McMullin f f f d = + The gols of he AP* Clculus progrm include he semen, Sudens should undersnd he definie inegrl s he ne ccumulion of chnge. 1 The Topicl Ouline includes
More informationAverage Case Lower Bounds for Monotone Switching Networks
Average Cae Lower Bound for Monoone Swiching Nework Yuval Filmu, Toniann Piai, Rober Robere, Sephen Cook Deparmen of Compuer Science Univeriy of Torono Monoone Compuaion (Refreher) Monoone circui were
More informationMathematics 805 Final Examination Answers
. 5 poins Se he Weiersrss M-es. Mhemics 85 Finl Eminion Answers Answer: Suppose h A R, nd f n : A R. Suppose furher h f n M n for ll A, nd h Mn converges. Then f n converges uniformly on A.. 5 poins Se
More informationLaplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)
Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful
More informationPrice Discrimination
My 0 Price Dicriminion. Direc rice dicriminion. Direc Price Dicriminion uing wo r ricing 3. Indirec Price Dicriminion wih wo r ricing 4. Oiml indirec rice dicriminion 5. Key Inigh ge . Direc Price Dicriminion
More informationAlgorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)
Algorihm and Daa Srucure 2011/ Week Soluion (Tue 15h - Fri 18h No) 1. Queion: e are gien 11/16 / 15/20 8/13 0/ 1/ / 11/1 / / To queion: (a) Find a pair of ube X, Y V uch ha f(x, Y) = f(v X, Y). (b) Find
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More informationResearch Article The General Solution of Differential Equations with Caputo-Hadamard Fractional Derivatives and Noninstantaneous Impulses
Hindwi Advnce in Mhemicl Phyic Volume 207, Aricle ID 309473, pge hp://doi.org/0.55/207/309473 Reerch Aricle The Generl Soluion of Differenil Equion wih Cpuo-Hdmrd Frcionl Derivive nd Noninnneou Impule
More informationReminder: Flow Networks
0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d
More informationSoviet Rail Network, 1955
7.1 Nework Flow Sovie Rail Nework, 19 Reerence: On he hiory o he ranporaion and maximum low problem. lexander Schrijver in Mah Programming, 91: 3, 00. (See Exernal Link ) Maximum Flow and Minimum Cu Max
More information1.0 Electrical Systems
. Elecricl Sysems The ypes of dynmicl sysems we will e sudying cn e modeled in erms of lgeric equions, differenil equions, or inegrl equions. We will egin y looking fmilir mhemicl models of idel resisors,
More informationSph3u Practice Unit Test: Kinematics (Solutions) LoRusso
Sph3u Prcice Uni Te: Kinemic (Soluion) LoRuo Nme: Tuey, Ocober 3, 07 Ku: /45 pp: /0 T&I: / Com: Thi i copy of uni e from 008. Thi will be imilr o he uni e you will be wriing nex Mony. you cn ee here re
More informationFlow Networks. Ma/CS 6a. Class 14: Flow Exercises
0/0/206 Ma/CS 6a Cla 4: Flow Exercie Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d e Sink 0/0/206 Flow
More informationMatching. Slides designed by Kevin Wayne.
Maching Maching. Inpu: undireced graph G = (V, E). M E i a maching if each node appear in a mo edge in M. Max maching: find a max cardinaliy maching. Slide deigned by Kevin Wayne. Biparie Maching Biparie
More informationA new model for solving fuzzy linear fractional programming problem with ranking function
J. ppl. Res. Ind. Eng. Vol. 4 No. 07 89 96 Journl of pplied Reserch on Indusril Engineering www.journl-prie.com new model for solving fuzzy liner frcionl progrmming prolem wih rning funcion Spn Kumr Ds
More informationCHAPTER 7: SECOND-ORDER CIRCUITS
EEE5: CI RCUI T THEORY CHAPTER 7: SECOND-ORDER CIRCUITS 7. Inroducion Thi chaper conider circui wih wo orage elemen. Known a econd-order circui becaue heir repone are decribed by differenial equaion ha
More informationChapter 2: Evaluative Feedback
Chper 2: Evluive Feedbck Evluing cions vs. insrucing by giving correc cions Pure evluive feedbck depends olly on he cion ken. Pure insrucive feedbck depends no ll on he cion ken. Supervised lerning is
More informationNetwork Flows UPCOPENCOURSEWARE number 34414
Nework Flow UPCOPENCOURSEWARE number Topic : F.-Javier Heredia Thi work i licened under he Creaive Common Aribuion- NonCommercial-NoDeriv. Unpored Licene. To view a copy of hi licene, vii hp://creaivecommon.org/licene/by-nc-nd/./
More informationCS 473G Lecture 15: Max-Flow Algorithms and Applications Fall 2005
CS 473G Lecure 1: Max-Flow Algorihm and Applicaion Fall 200 1 Max-Flow Algorihm and Applicaion (November 1) 1.1 Recap Fix a direced graph G = (V, E) ha doe no conain boh an edge u v and i reveral v u,
More informationNetwork Flow. Data Structures and Algorithms Andrei Bulatov
Nework Flow Daa Srucure and Algorihm Andrei Bulao Algorihm Nework Flow 24-2 Flow Nework Think of a graph a yem of pipe We ue hi yem o pump waer from he ource o ink Eery pipe/edge ha limied capaciy Flow
More informationu(t) Figure 1. Open loop control system
Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference
More information1. Find a basis for the row space of each of the following matrices. Your basis should consist of rows of the original matrix.
Mh 7 Exm - Prcice Prolem Solions. Find sis for he row spce of ech of he following mrices. Yor sis shold consis of rows of he originl mrix. 4 () 7 7 8 () Since we wn sis for he row spce consising of rows
More informationarxiv: v1 [cs.cg] 21 Mar 2013
On he rech facor of he Thea-4 graph Lui Barba Proenji Boe Jean-Lou De Carufel André van Renen Sander Verdoncho arxiv:1303.5473v1 [c.cg] 21 Mar 2013 Abrac In hi paper we how ha he θ-graph wih 4 cone ha
More informationExponential Sawtooth
ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM SOLUTION. Exponenial Sawooh: The eaie way o do hi problem i o look a he Fourier ranform of a ingle exponenial funcion, () = exp( )u(). From he able
More information2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V
ME 352 VETS 2. VETS Vecor algebra form he mahemaical foundaion for kinemaic and dnamic. Geomer of moion i a he hear of boh he kinemaic and dnamic of mechanical em. Vecor anali i he imehonored ool for decribing
More information6.8 Laplace Transform: General Formulas
48 HAP. 6 Laplace Tranform 6.8 Laplace Tranform: General Formula Formula Name, ommen Sec. F() l{ f ()} e f () d f () l {F()} Definiion of Tranform Invere Tranform 6. l{af () bg()} al{f ()} bl{g()} Lineariy
More informationSection P.1 Notes Page 1 Section P.1 Precalculus and Trigonometry Review
Secion P Noe Pge Secion P Preclculu nd Trigonomer Review ALGEBRA AND PRECALCULUS Eponen Lw: Emple: 8 Emple: Emple: Emple: b b Emple: 9 EXAMPLE: Simplif: nd wrie wi poiive eponen Fir I will flip e frcion
More information5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method
ME 352 GRHICL VELCITY NLYSIS 52 GRHICL VELCITY NLYSIS olygon Mehod Velociy analyi form he hear of kinemaic and dynamic of mechanical yem Velociy analyi i uually performed following a poiion analyi; ie,
More informationHermite-Hadamard-Fejér type inequalities for convex functions via fractional integrals
Sud. Univ. Beş-Bolyi Mh. 6(5, No. 3, 355 366 Hermie-Hdmrd-Fejér ype inequliies for convex funcions vi frcionl inegrls İmd İşcn Asrc. In his pper, firsly we hve eslished Hermie Hdmrd-Fejér inequliy for
More informationMaximum Flow and Minimum Cut
// Sovie Rail Nework, Maximum Flow and Minimum Cu Max flow and min cu. Two very rich algorihmic problem. Cornerone problem in combinaorial opimizaion. Beauiful mahemaical dualiy. Nework Flow Flow nework.
More informationAn integral having either an infinite limit of integration or an unbounded integrand is called improper. Here are two examples.
Improper Inegrls To his poin we hve only considered inegrls f(x) wih he is of inegrion nd b finie nd he inegrnd f(x) bounded (nd in fc coninuous excep possibly for finiely mny jump disconinuiies) An inegrl
More informationIntroduction to SLE Lecture Notes
Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will
More informationLaplace Examples, Inverse, Rational Form
Lecure 3 Ouline: Lplce Exple, Invere, Rionl For Announceen: Rein: 6: Lplce Trnfor pp. 3-33, 55.5-56.5, 7 HW 8 poe, ue nex We. Free -y exenion OcenOne Roo Tour will e fer cl y 7 (:3-:) Lunch provie ferwr.
More informationt s (half of the total time in the air) d?
.. In Cl or Homework Eercie. An Olmpic long jumper i cpble of jumping 8.0 m. Auming hi horizonl peed i 9.0 m/ he lee he ground, how long w he in he ir nd how high did he go? horizonl? 8.0m 9.0 m / 8.0
More informationPhysics 240: Worksheet 16 Name
Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,
More informationExponential Decay for Nonlinear Damped Equation of Suspended String
9 Inernionl Symoium on Comuing, Communicion, nd Conrol (ISCCC 9) Proc of CSIT vol () () IACSIT Pre, Singore Eonenil Decy for Nonliner Dmed Equion of Suended Sring Jiong Kemuwn Dermen of Mhemic, Fculy of
More informationGreedy. I Divide and Conquer. I Dynamic Programming. I Network Flows. Network Flow. I Previous topics: design techniques
Algorihm Deign Technique CS : Nework Flow Dan Sheldon April, reedy Divide and Conquer Dynamic Programming Nework Flow Comparion Nework Flow Previou opic: deign echnique reedy Divide and Conquer Dynamic
More informationPHYSICS 1210 Exam 1 University of Wyoming 14 February points
PHYSICS 1210 Em 1 Uniersiy of Wyoming 14 Februry 2013 150 poins This es is open-noe nd closed-book. Clculors re permied bu compuers re no. No collborion, consulion, or communicion wih oher people (oher
More informationToday s topics. CSE 421 Algorithms. Problem Reduction Examples. Problem Reduction. Undirected Network Flow. Bipartite Matching. Problem Reductions
Today opic CSE Algorihm Richard Anderon Lecure Nework Flow Applicaion Prolem Reducion Undireced Flow o Flow Biparie Maching Dijoin Pah Prolem Circulaion Loweround conrain on flow Survey deign Prolem Reducion
More informationAlgorithm Design and Analysis
Algorihm Deign and Analyi LECTURES 17 Nework Flow Dualiy of Max Flow and Min Cu Algorihm: Ford-Fulkeron Capaciy Scaling Sofya Rakhodnikova S. Rakhodnikova; baed on lide by E. Demaine, C. Leieron, A. Smih,
More informationcan be viewed as a generalized product, and one for which the product of f and g. That is, does
Boyce/DiPrim 9 h e, Ch 6.6: The Convoluion Inegrl Elemenry Differenil Equion n Bounry Vlue Problem, 9 h eiion, by Willim E. Boyce n Richr C. DiPrim, 9 by John Wiley & Son, Inc. Someime i i poible o wrie
More informationSample Final Exam (finals03) Covering Chapters 1-9 of Fundamentals of Signals & Systems
Sample Final Exam Covering Chaper 9 (final04) Sample Final Exam (final03) Covering Chaper 9 of Fundamenal of Signal & Syem Problem (0 mar) Conider he caual opamp circui iniially a re depiced below. I LI
More informationFURTHER GENERALIZATIONS. QI Feng. The value of the integral of f(x) over [a; b] can be estimated in a variety ofways. b a. 2(M m)
Univ. Beogrd. Pul. Elekroehn. Fk. Ser. M. 8 (997), 79{83 FUTHE GENEALIZATIONS OF INEQUALITIES FO AN INTEGAL QI Feng Using he Tylor's formul we prove wo inegrl inequliies, h generlize K. S. K. Iyengr's
More informationEE Control Systems LECTURE 2
Copyrigh F.L. Lewi 999 All righ reerved EE 434 - Conrol Syem LECTURE REVIEW OF LAPLACE TRANSFORM LAPLACE TRANSFORM The Laplace ranform i very ueful in analyi and deign for yem ha are linear and ime-invarian
More informationESSLLI 2007 COURSE READER. ESSLLI is the Annual Summer School of FoLLI, The Association for Logic, Language and Information
ESSLLI 2007 19h Europen Summer School in Logic, Lnguge nd Inormion Augus 6-17, 2007 hp://www.cs.cd.ie/esslli2007 Triniy College Dulin Irelnd COURSE READER ESSLLI is he Annul Summer School o FoLLI, The
More informationA LIMIT-POINT CRITERION FOR A SECOND-ORDER LINEAR DIFFERENTIAL OPERATOR IAN KNOWLES
A LIMIT-POINT CRITERION FOR A SECOND-ORDER LINEAR DIFFERENTIAL OPERATOR j IAN KNOWLES 1. Inroducion Consider he forml differenil operor T defined by el, (1) where he funcion q{) is rel-vlued nd loclly
More informationLecture 2: Network Flow. c 14
Comp 260: Avne Algorihms Tufs Universiy, Spring 2016 Prof. Lenore Cowen Srie: Alexner LeNil Leure 2: Nework Flow 1 Flow Neworks s 16 12 13 10 4 20 14 4 Imgine some nework of pipes whih rry wer, represene
More informationGEOMETRIC EFFECTS CONTRIBUTING TO ANTICIPATION OF THE BEVEL EDGE IN SPREADING RESISTANCE PROFILING
GEOMETRIC EFFECTS CONTRIBUTING TO ANTICIPATION OF THE BEVEL EDGE IN SPREADING RESISTANCE PROFILING D H Dickey nd R M Brennn Solecon Lbororie, Inc Reno, Nevd 89521 When preding reince probing re mde prior
More informationSLOW INCREASING FUNCTIONS AND THEIR APPLICATIONS TO SOME PROBLEMS IN NUMBER THEORY
VOL. 8, NO. 7, JULY 03 ISSN 89-6608 ARPN Jourl of Egieerig d Applied Sciece 006-03 Ai Reerch Publihig Nework (ARPN). All righ reerved. www.rpjourl.com SLOW INCREASING FUNCTIONS AND THEIR APPLICATIONS TO
More informationGeometric Path Problems with Violations
Click here o view linked Reference 1 1 1 0 1 0 1 0 1 0 1 Geomeric Pah Problem wih Violaion Anil Mahehwari 1, Subha C. Nandy, Drimi Paanayak, Saanka Roy and Michiel Smid 1 1 School of Compuer Science, Carleon
More information16 Max-Flow Algorithms and Applications
Algorihm A proce canno be underood by opping i. Underanding mu move wih he flow of he proce, mu join i and flow wih i. The Fir Law of Mena, in Frank Herber Dune (196) There a difference beween knowing
More information! Abstraction for material flowing through the edges. ! G = (V, E) = directed graph, no parallel edges.
Sovie Rail Nework, haper Nework Flow Slide by Kevin Wayne. opyrigh Pearon-ddion Weley. ll righ reerved. Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming,
More information