Towards Better Approximation of Graph Crossing Number
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 26-minute IEEE conference talk on improving approximations for graph crossing numbers. Delve into previous work on general and bounded-degree graphs, crossing numbers with rotation systems, and a new framework presented by Julia Chuzhoy, Sepideh Mahabadi, and Zihan Tan from Toyota Technological Institute at Chicago and the University of Chicago. Gain insights into the intuition behind Chuzhoy 11 and follow the plan for proving Main Theorem 1. Conclude with a comprehensive summary of the presented research and its implications for graph theory and computational geometry.
Syllabus
Intro
Graph Crossing Number
Previous Work on General Graphs
Previous Work on Bounded-Degree Graphs
Crossing Number with Rotation Systems
New Framework
Intuition Chuzhoy 11
Plan for Proving Main Theorem 1
Proof of Main Theorem 1
Summary
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube