A Polynomial Time Approximation Scheme for Facility Location on Planar Graphs
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 23-minute IEEE conference talk delving into the development of a polynomial time approximation scheme for solving facility location problems on planar graphs. Learn about the innovative approaches presented by Vincent Cohen-Addad, Marcin Pilipczuk, and Michał Pilipczuk as they discuss algorithmic techniques for optimizing facility placement in complex network structures.
Syllabus
A Polynomial Time Approximation Scheme for Facility Location on Planar Graphs
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera