35% Off Finance Skills That Get You Hired - Code CFI35
Earn Your CS Degree, Tuition-Free, 100% Online!
Overview
Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
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