PodParley PodParley
PodParley
15: Algorithmen II, Vorlesung, WS 2018/19, 03.12.2018 episode artwork

EPISODE · Dec 4, 2018 · 1H 27M

15: Algorithmen II, Vorlesung, WS 2018/19, 03.12.2018

from Algorithmen 2, Vorlesung, WS18/19 · host Prof. Dr. Peter Sanders

15 | 0:00:00 Starten 0:00:05 8 Approximationsalgorithmen 0:00:23 Scheduling unabhängiger gewichteter Jobs auf parallelen Machinen 0:01:03 List Scheduling 0:01:27 Viele Kleine Jobs 0:04:13 Der Approximationsfaktor 0:08:23 Diese Schranke is bestmöglich 0:10:04 Mehr zu Scheduling 0:24:05 Nichtapproximierbarkeit des Handlungsreisendenproblems (TSP) 0:29:53 TSP mit Dreiecksungleichung 0:31:12 2-Approximation durch minimalen Spannbaum 0:35:57 Beispiel 0:40:12 Mehr TSP 0:51:39 Pseudopolynomielle Algorithmen 0:53:41 Beispiel Rucksackproblem 0:55:38 Dynamische Programmierung nach Profit 0:56:59 Fully Polynomial Time Approximation Scheme 1:00:23 FPTAS für Knapsack 1:02:42 Das beste bekannte FPTAS 1:04:31 Fully Polynomial Time Approximation Scheme 1:05:16 Optimale Algorithmen für das Rucksackproblem 1:09:58 9 Fixed-Parameter-Algorithmen 1:11:51 Beispiel: VERTEX COVER (Knotenüberdeckung) 1:13:32 VERTEX COVER Grundlegendes 1:16:02 FIxed parameter tractable 1:19:06 Naive tiefenbeschränkte Suche 1:23:27 Kernbildung für Vertex Cover

What this episode covers

15 | 0:00:00 Starten 0:00:05 8 Approximationsalgorithmen 0:00:23 Scheduling unabhängiger gewichteter Jobs auf parallelen Machinen 0:01:03 List Scheduling 0:01:27 Viele Kleine Jobs 0:04:13 Der Approximationsfaktor 0:08:23 Diese Schranke is bestmöglich 0:10:04 Mehr zu Scheduling 0:24:05 Nichtapproximierbarkeit des Handlungsreisendenproblems (TSP) 0:29:53 TSP mit Dreiecksungleichung 0:31:12 2-Approximation durch minimalen Spannbaum 0:35:57 Beispiel 0:40:12 Mehr TSP 0:51:39 Pseudopolynomielle Algorithmen 0:53:41 Beispiel Rucksackproblem 0:55:38 Dynamische Programmierung nach Profit 0:56:59 Fully Polynomial Time Approximation Scheme 1:00:23 FPTAS für Knapsack 1:02:42 Das beste bekannte FPTAS 1:04:31 Fully Polynomial Time Approximation Scheme 1:05:16 Optimale Algorithmen für das Rucksackproblem 1:09:58 9 Fixed-Parameter-Algorithmen 1:11:51 Beispiel: VERTEX COVER (Knotenüberdeckung) 1:13:32 VERTEX COVER Grundlegendes 1:16:02 FIxed parameter tractable 1:19:06 Naive tiefenbeschränkte Suche 1:23:27 Kernbildung für Vertex Cover

NOW PLAYING

15: Algorithmen II, Vorlesung, WS 2018/19, 03.12.2018

0:00 1:27:08

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

Share this episode

Similar Episodes

Air Stream Stupid

Jan 8, 2026 ·16m

Getting our Kix for 2026

Jan 2, 2026 ·12m

Gaya Family Interview

Aug 22, 2025 ·49m

トランプ関税でNISAで大損⁉投資初心者が騙されがちなNISAの仕組み

Apr 29, 2025 ·12m

ふるさと納税大転換！ポイント還元がなくなる？

Apr 27, 2025 ·11m

【番外編】大阪万博に行ったインターン生にインタビュー！

Apr 24, 2025 ·11m

Similar Podcasts

いろはにマネーの「ながら学習」 IrohaniMoney この番組では、インターン生2人が、金融、経済、投資関連の気になる情報を分かりやすくお伝えしていきます。インターン生の会話を「ながら聴き」する感覚で一緒に勉強していきましょう！ご意見箱フォーム：https://forms.gle/TTGaVP2TJksNMKJo7ぜひお便りや感想をお待ちしています！公式X：https://x.com/irohanimoney番組のハッシュタグは「#いろはにながら」です。番組への感想をお待ちしています！いろはにマネー：https://www.bridge-salon.jp/money/姉妹サイト：https://kabu.bridge-salon.jp/姉妹サイト：https://bridge-salon.jp/(株)インベストメントブリッジ運営 French Your Way Jessica: Native French teacher founder of French Your Way Boost your French listening skills and test your comprehension with this one of a kind series of podcasts. Get the chance to listen to a real conversation between native speakers talking at normal speed AND customise your learning experience through carefully designed sets of questions (2 levels of difficulty) available for download at www.frenchvoicespodcast.com. All interviews also come with the transcript. French teacher Jessica interviews native speakers of French from around the world who share a bit of their life and passion. Where else would you meet in one same place a French yoga teacher based in Melbourne, a soap manufacturer from Provence, or a couple cycling around the world? 2 Old Ladies Walking Rozee 2 Old Ladies Walking features the journeys, insights, and light conversation between Liz and Rosie, two women of a certain age who live in the Hudson Valley of New York. From pelvic floor challenges and life with young adult children to food, bird calls, fear of “mad lamb” disease, and myriad topics in between, we cover it all while walking on the scenic trails of the northeast, or wherever our travels take us. Join us and have a listen! TV 2 - Veien til EM TV 2 og Moderne Media Velkommen til TV 2's EM podkast. Dette er tidenes første EM-podkast fra TV 2. I dagene før kamper skal Jesper Mathisen, Jan-Henrik Børslid og Espen Solbakken m/gjester lade opp. God fornøyelse! For annonsering: [email protected] booking: [email protected]

Frequently Asked Questions

How long is this episode of Algorithmen 2, Vorlesung, WS18/19?

This episode is 1 hour and 27 minutes long.

When was this Algorithmen 2, Vorlesung, WS18/19 episode published?

This episode was published on December 4, 2018.

What is this episode about?

15 | 0:00:00 Starten 0:00:05 8 Approximationsalgorithmen 0:00:23 Scheduling unabhängiger gewichteter Jobs auf parallelen Machinen 0:01:03 List Scheduling 0:01:27 Viele Kleine Jobs 0:04:13 Der Approximationsfaktor 0:08:23 Diese Schranke is...

Can I download this Algorithmen 2, Vorlesung, WS18/19 episode?

Yes, you can download this episode by clicking the download button on the episode player, or subscribe to the podcast in your preferred podcast app for automatic downloads.
URL copied to clipboard!