<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://scale.iti.kit.edu/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://scale.iti.kit.edu/feed.php">
        <title>scale - teaching:2025ws:beating_wc</title>
        <description></description>
        <link>https://scale.iti.kit.edu/</link>
        <image rdf:resource="https://scale.iti.kit.edu/_media/favicon.ico" />
       <dc:date>2026-05-01T11:06:58+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://scale.iti.kit.edu/teaching/2025ws/beating_wc/start?rev=1765978794&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://scale.iti.kit.edu/_media/favicon.ico">
        <title>scale</title>
        <link>https://scale.iti.kit.edu/</link>
        <url>https://scale.iti.kit.edu/_media/favicon.ico</url>
    </image>
    <item rdf:about="https://scale.iti.kit.edu/teaching/2025ws/beating_wc/start?rev=1765978794&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2025-12-17T13:39:54+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>Beating the Worst Case</title>
        <link>https://scale.iti.kit.edu/teaching/2025ws/beating_wc/start?rev=1765978794&amp;do=diff</link>
        <description>Beating the Worst Case

Lecturers: Jean-Pierre, Marcus

First Session: Wednesday 29.10. at 15:45 (Building 50.34 Room 301)




In the practical course Beating the Worst Case in Practice: Unexpectedly Efficient Algorithms, we focus on algorithms that are significantly more efficient on real-world instances than theoretical worst-case analyses would suggest. This unexpected efficiency is investigated empirically during the course. For this purpose, we provide different algorithmic approaches and p…</description>
    </item>
</rdf:RDF>
