Classic Problems with Modern Techniques - Prize-collecting Framework
Offered By: BIMSA via YouTube
Course Description
Overview
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
Linear and Integer ProgrammingUniversity of Colorado Boulder via Coursera Maths Essentials
Imperial College London via edX Introduction To Soft Computing
Indian Institute of Technology, Kharagpur via Swayam Artificial Intelligence
Udacity Математические методы и модели в экономике
National Research Nuclear University MEPhI via Coursera