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
Introducing Graph TheoryYouTube Graph Theory
Math at Andrews via YouTube Planar Graphs Have Bounded Queue-Number
IEEE via YouTube Miracles of Algebraic Graph Theory
Joint Mathematics Meetings via YouTube Origami Software from Scratch
Strange Loop Conference via YouTube