Hosted by Dailymotion. For legal issues report at the Copyright Center, report us on DMC, or use the Instant Removal tool.
[Lecture 6:1/3] Using Randomness in Computer Science
61 Views • Feb 04, 2011
Description
Feb 2, 2011 - 16:15-19:15 - Exhaustive Sampling
• A constant time (1+ε)-approximation for the size of a maximal matching in constant maximum degree graphs
• Exhaustive guessing 1: a polynomial time randomized (1+ε)-approximation (PTRAS) for Max-CUT in dense graphs
More from User
[2017 MPRI 2.11.1] Molecular programming 3/4 (8 NOV)
Nicolas Schabanel
[2017 MPRI 2.11.1] Molecular programming 4/4 (15 NOV)
Nicolas Schabanel
[2017 MPRI 2.11.1] Molecular programming 2/4 (25 OCT)
Nicolas Schabanel
[2017 MPRI 2.11.1] Molecular programming 1:4 (18 OCT)
Nicolas Schabanel
[2016 MPRI 2.11.1] 7. Nature Programming: Intrisic Universality & Other models including Oritatami (2016/11/9)
Nicolas Schabanel
[2016 MPRI 2.11.1] 6. Nature Programming: Universality in Tile Assembly Systems (2016/11/2)
Nicolas Schabanel
Related Videos
[Lecture 3:2/9] Using randomness in Computer Science
Nicolas Schabanel
[Lecture 3:5/9] Using randomness in Computer Science
Nicolas Schabanel
[Lecture 7:3/3] Using Randomness in Computer Science
Nicolas Schabanel
[Lecture 5:2/3] Using Randomness in Computer Science
Nicolas Schabanel
[Lecture 3:1/9] Using randomness in Computer Science
Nicolas Schabanel
[Lecture 4:1/3] Using Randomness in Computer Science
Nicolas Schabanel