Vertex Cover Approximation

  Рет қаралды 3,455

Computational Thinking

Computational Thinking

Күн бұрын

Пікірлер: 3
@arthur.s
@arthur.s 7 ай бұрын
Incredibly high quality video, thank you very much!
@user-fb4iv4me6g
@user-fb4iv4me6g Жыл бұрын
5:12. If C* is the optimal solution. How come we say C*>=C? Why would the optimal solution be larger or equal to the approx solution? Shouldn't it be the other way around?
@discoETH
@discoETH Жыл бұрын
the statement c* >= c is correct in this context. Since the blue edges (c=3) are sufficiently apart in the example, we need at least 3 (c*) nodes to cover these edges. This is generally true. If some c edges do not share any node, c* is at least as large as c.
Bin Packing Approximation
6:21
Computational Thinking
Рет қаралды 17 М.
Linear Programming 12: Minimum vertex cover
16:12
Henry Adams
Рет қаралды 16 М.
Deadpool family by Tsuriki Show
00:12
Tsuriki Show
Рет қаралды 6 МЛН
Turn Off the Vacum And Sit Back and Laugh 🤣
00:34
SKITSFUL
Рет қаралды 9 МЛН
Lamborghini vs Smoke 😱
00:38
Topper Guild
Рет қаралды 56 МЛН
Traveling Salesperson Problem Approximation
8:03
Computational Thinking
Рет қаралды 4,6 М.
Vertex Covers and Vertex Covering Numbers | Graph Theory
15:33
Wrath of Math
Рет қаралды 23 М.
Learn About Approximation Algorithms for Bin Packing
12:16
Cyber Enlightener
Рет қаралды 209
P vs. NP: The Biggest Puzzle in Computer Science
19:44
Quanta Magazine
Рет қаралды 895 М.
12.0 - Approximation Algorithms
25:55
Daniel Sutantyo
Рет қаралды 37 М.
Vertex Cover is NP-Complete + Example
19:13
Easy Theory
Рет қаралды 31 М.
Introduction to Approximation Algorithms - K Center Problem
10:38
Introduction to Graph Theory: A Computer Science Perspective
16:26
NP Completeness 8 - Vertex Cover Problem
7:10
Professor Painter
Рет қаралды 24 М.