![](https://ccweb.imgix.net/https%3A%2F%2Fwww.classcentral.com%2Fimages%2Ficon-black-friday.png?auto=format&ixlib=php-4.1.0&s=fe56b83c82babb2f8fce47a2aed2f85d)
Overview
![](https://ccweb.imgix.net/https%3A%2F%2Fwww.classcentral.com%2Fimages%2Ficon-black-friday.png?auto=format&ixlib=php-4.1.0&s=fe56b83c82babb2f8fce47a2aed2f85d)
This course aims to help learners improve their approximation of graph crossing numbers. The course covers topics such as previous work on general graphs and bounded-degree graphs, crossing numbers with rotation systems, a new framework, and the intuition behind the main theorem. The course teaches skills in analyzing graph structures and developing approximation algorithms. The teaching method includes lectures and proofs of the main theorem. This course is intended for individuals interested in graph theory, approximation algorithms, and computational mathematics.
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