Lecture

Theory of Computation Laboratory 2: Resource Allocation and Network Design

Description

This lecture covers approximation algorithms for resource allocation problems like the Santa Claus problem and makespan scheduling, as well as for network design problems such as the Traveling Salesman and Steiner forest. It also delves into learning augmented algorithms with predictions, discussing competitive algorithms for the TCP acknowledgment problem and experimental results.

Official source

https://mediaspace.epfl.ch/media/0_39c8ujud

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related lectures (8)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.