YoVDO

Classic Problems with Modern Techniques - Prize-collecting Framework

Offered By: BIMSA via YouTube

Tags

Approximation Algorithms Courses Network Design Courses Clustering Algorithms Courses Optimization Problems Courses Traveling Salesman Problem Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore cutting-edge approximation algorithms for classic network design problems in this comprehensive lecture. Delve into the Prize-collecting Framework, which addresses optimization challenges where multiple demands seek service from the most cost-effective structure. Learn about innovative approaches to problems such as Minimum Spanning Tree, Steiner Tree, TSP, Steiner Forest, and Steiner Networks. Discover how modern techniques, including clustering algorithms and recursive methodologies, are applied to solve these complex issues. Gain insights into the latest advancements in approximation algorithms for Prize-collecting Steiner Forest and Prize-collecting Steiner Tree, presented by Mohammad Taghi Hajiaghayi at ICBS2024.

Syllabus

Mohammad Taghi Hajiaghayi: Classic Problems with Modern Techniques #ICBS2024


Taught by

BIMSA

Related Courses

An Introduction to Computer Networks
Stanford University via Independent
A System View of Communications: From Signals to Packets (Part 3)
The Hong Kong University of Science and Technology via edX
A System View of Communications: From Signals to Packets (Part 2)
The Hong Kong University of Science and Technology via edX
Aplicaciones de la Teoría de Grafos a la Vida Real (I)
Universitat Politècnica de València via edX
Aplicaciones de la Teoría de Grafos a la vida real II
Universitat Politècnica de València via edX