Re: [Mittagsseminar TI] Fwd: [i-prof] Einladung zur Verteidigung meiner Bachelorarbeit

[Wolfgang Mulzer <mulzer@inf.fu-berlin.de>]

Reminder: Today's Mittagsseminar will be online, live from Georgia. I am 
not sure whether it will be in German or in English...

Cheers

Wolfgang

On 12/12/2024 10:21, Wolfgang Mulzer wrote:
> This will be the Mittagsseminar for next Tuesday, 17.12..
> The talk will be given via WebEx, since the speaker is in Georgia.
>
> Cheers
>
> Wolfgang
>
>
> -------- Forwarded Message --------
> Subject: [i-prof] Einladung zur Verteidigung meiner Bachelorarbeit
> Date: Wed, 11 Dec 2024 14:28:33 +0100
> From: Giorgi Gvatua <giog00@zedat.fu-berlin.de>
> To: i-profs@inf.fu-berlin.de
> CC: i-wimis@inf.fu-berlin.de, i-studi@inf.fu-berlin.de, 
> maria.koekenhoff@fu-berlin.de
>
> Sehr geehrte Damen und Herren,
>
> hiermit lade ich Sie herzlich zur Verteidigung meiner Bachelorarbeit mit
> dem Titel "Exploration of Minimum Cost Flow Algorithms" ein.
>
>
> Die Verteidigung findet online über Webex statt.
>
> Datum und Uhrzeit: 17.12.2024, 12:00 Uhr
>
> Betreuer: Prof. Dr. Wolfgang Mulzer
> Zweitgutachter: Prof. Dr. Max Willert
>
>
> Webex-Link:
> https://fu-berlin.webex.com/fu-berlin-en/j.php? 
> MTID=mbeb27ad70566aae985b6dc3f929c7339
>
> Meeting number (access code): 2793 825 0192
> Meeting password: hXJx3eMBF38 (49593362 when dialing from a phone or video
> system)
>
>
>
> Mit freundlichen Grüßen,
> Giorgi Gvatua
>
>
> Abstract:
>
> The Minimum Cost Flow problem is one of the cornerstones in optimization 
> and
> graph theory, having a wide variety of applications in telecommunications,
> logistics, supply chain management, and bipartite matching. This work
> concentrates on unit-capacity networks, revisiting basic MCF algorithms
> that demonstrate both their special challenges and their opportunities for
> optimization. The two algorithmic frameworks considered in some detail
> include the Pseudoflow Framework, which deploys cost-scaling methods to
> achieve computational efficiency, and the Cycle Canceling Framework, which
> generates a sequence of feasible solutions where each successive solution
> is improved through the elimination of negative-cost cycles. Comparative
> analysis highlights the trade-offs in computational complexity and
> practical applicability, stating the strengths of the Pseudoflow Framework
> for dense network applications, while the Cycle Canceling Framework has
> the best advantage in sparse or incremental optimizations. The work now
> synthesizes especially those advances on the work of Goldberg et al. and
> also advises the route forward, including hybrid methodologies and
> integrations with emergent computational paradigms. This thesis
> contributes to both the theoretical understanding and practical
> implementation of MCF algorithms and gives insight into how scalable and
> efficient solutions for real-world network optimization problems can be
> achieved.
>
> _______________________________________________
> Automatischer Mailverteiler an Gruppe 'ml-i-prof-mi'.
> Hinweise dazu siehe Hilfeseite:
> https://www.mi.fu-berlin.de/w/Tec/AnkuendigungsVerteiler

Attachment: smime.p7s
Description: S/MIME Cryptographic Signature