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.
A Polynomial Time Approximation Scheme for Facility Location on Planar Graphs
Overview
Syllabus
A Polynomial Time Approximation Scheme for Facility Location on Planar Graphs
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Approximation Algorithms
-
Parametric Shortest Paths in Planar Graphs
-
On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs
-
A Parameterized Approximation Scheme for Min k-Cut
-
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
-
Independent Set on P_k-Free Graphs in Quasi-Polynomial Time
