Explore a 21-minute IEEE conference talk on parametric shortest paths in planar graphs, presented by Kshitij Gajjar and Jaikumar Radhakrishnan. Delve into the intricacies of graph theory and algorithmic approaches for solving shortest path problems in planar graphs with parametric edge weights. Gain insights into the latest research and advancements in this specialized area of computer science and mathematics.
Overview
Syllabus
Parametric Shortest Paths in Planar Graphs
Taught by
IEEE FOCS: Foundations of Computer Science
