Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs

Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs

Simons Institute via YouTube Direct link

Sublinear time algorithms for better than 1/2 approximation algorithms for max-cut on expanders

1 of 1

1 of 1

Sublinear time algorithms for better than 1/2 approximation algorithms for max-cut on expanders

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Sublinear time algorithms for better than 1/2 approximation algorithms for max-cut on expanders

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.