04: Algorithmen 2, Vorlesung, WS 2017/18, 30.10.2017

from Algorithmen 2, Vorlesung, WS17/18 · host Worsch, Thomas

04 | 0:00:00 Starten 0:01:07 Suchprobleme 0:04:15 Approximation bei Suchprobleme 0:07:10 Approximation bei Zählprobleme 0:08:51 Job Scheduling: Aufgabenstellung 0:13:14 Naheliegender Algorithmus: listScheduling 0:20:19 Eigenschaften des Algorithmus 0:26:55 Approxiamtionsfaktor 0:28:43 Eigenschaften des Algorithmus (2) 0:34:43 Erinnerung: TSP-Suchproblem 0:37:41 TSP-alpha-Approximations-Suchproblem 0:40:06 Erinnerung: Hamiltonkreis (Entscheidungdproblem) 0:41:02 Schwere Approximierbarkeit des TSP 0:42:09 Schwere Approximierbarkeit des TST: Konstruktion 0:52:57 MetricTSP

Episode metadata supplied by the publisher feed · Published Nov 3, 2017

Embed this episode

Attribution link and audio player

NOW PLAYING

04: Algorithmen 2, Vorlesung, WS 2017/18, 30.10.2017

0:00 1:07:29

1×

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

No similar episodes found.

Similar Podcasts

Route 2 Adventure Peter Route 2 Adventure has interviews, reviews and research for the outdoor enthusiast as well as those in the RV world. Join Pete Robinson and his Airstream Meadowlark as he ventures into a life lived one rivet at a time.

Frequently Asked Questions

How long is this episode of Algorithmen 2, Vorlesung, WS17/18?

This episode is 1 hour and 7 minutes long.

When was this Algorithmen 2, Vorlesung, WS17/18 episode published?

This episode was published on November 3, 2017.

Can I download this Algorithmen 2, Vorlesung, WS17/18 episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.

URL copied to clipboard!