ViewTube

ViewTube
Sign inSign upSubscriptions
Filters

Upload date

Type

Duration

Sort by

Features

Reset

2,227,019 results

MIT OpenCourseWare
17. Complexity: Approximation Algorithms

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:21:08
17. Complexity: Approximation Algorithms

91,475 views

9 years ago

MIT OpenCourseWare
R9. Approximation Algorithms: Traveling Salesman Problem

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

31:59
R9. Approximation Algorithms: Traveling Salesman Problem

140,202 views

9 years ago

Professor Bryce
Approximation Algorithms (Algorithms 25)

Davidson CSC 321: Analysis of Algorithms, F22. Week 14 - Monday.

18:01
Approximation Algorithms (Algorithms 25)

7,204 views

3 years ago

Computer Science Theory Explained
Approximation Algorithms

Textbooks: Computational Complexity: A Modern Approach by S. Arora and B. Barak. Algorithm Design by J. Kleinberg and E.

4:55
Approximation Algorithms

10,413 views

4 years ago

Daniel Sutantyo
12.0 - Approximation Algorithms

So in summary what did you learn well you learn about row approximation algorithm specifically about two approximate algorithm ...

25:55
12.0 - Approximation Algorithms

42,193 views

5 years ago

Programming and Math Tutorials
TSP Approximation Algorithms | Solving the Traveling Salesman Problem

This video explores the Traveling Salesman Problem, and explains two approximation algorithms for finding a solution in ...

12:46
TSP Approximation Algorithms | Solving the Traveling Salesman Problem

73,595 views

5 years ago

People also watched

Numberphile
Egyptian Fractions and the Greedy Algorithm - Numberphile

Featuring Sophie Maclean. See https://brilliant.org/numberphile for Brilliant and 20% off their premium service & 30-day trial ...

9:47
Egyptian Fractions and the Greedy Algorithm - Numberphile

184,434 views

2 years ago

Very Normal
The algorithm that (eventually) revolutionized statistics  - #SoMEpi

My submission to the Summer of Math Exposition, community edition: a video on the Metropolis algorithm and how it works ...

17:36
The algorithm that (eventually) revolutionized statistics - #SoMEpi

97,295 views

1 year ago

UWCS - University of Warwick Computing Society
⚡ Box Packing is Hard - Keegan R

A seemingly simple talk about trying to put boxes in boxes. What could go wrong? No prizes for guessing, but quite a lot actually.

17:48
⚡ Box Packing is Hard - Keegan R

11,574 views

3 years ago

MIT OpenCourseWare
16. Complexity: P, NP, NP-completeness, Reductions

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:25:25
16. Complexity: P, NP, NP-completeness, Reductions

473,556 views

9 years ago

MIT OpenCourseWare
19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:17:34
19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees

31,294 views

9 years ago

Serrano.Academy
Universal Approximation Theorem - The Fundamental Building Block of Deep Learning

The Universal Approximation Theorem is the most fundamental theorem in deep learning. It says that any continuous function can ...

13:16
Universal Approximation Theorem - The Fundamental Building Block of Deep Learning

11,592 views

11 months ago

MIT OpenCourseWare
R8. NP-Complete Problems

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

45:47
R8. NP-Complete Problems

138,199 views

9 years ago

MIT OpenCourseWare
18. Complexity: Fixed-Parameter Algorithms

MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: http://ocw.mit.edu/6-046JS15 Instructor: ...

1:17:43
18. Complexity: Fixed-Parameter Algorithms

37,241 views

9 years ago

hackerdashery
P vs. NP and the Computational Complexity Zoo

Hackerdashery #2 Inspired by the Complexity Zoo wiki: https://complexityzoo.uwaterloo.ca/Complexity_Zoo For more advanced ...

10:44
P vs. NP and the Computational Complexity Zoo

3,573,831 views

11 years ago

The Coding Train
Coding Challenge 35: Traveling Salesperson

In Part 1 of this multi-part coding challenge, I introduce the classic computer science problem of the Traveling Salesperson (TSP) ...

22:55
Coding Challenge 35: Traveling Salesperson

293,165 views

9 years ago

Ryan O'Donnell
Great Ideas in Theoretical Computer Science: Approximation Algorithms (Spring 2016)

CMU 15-251: Great Ideas in Theoretical Computer Science Spring 2016 Lecture #15: Approximation Algorithms ...

1:19:30
Great Ideas in Theoretical Computer Science: Approximation Algorithms (Spring 2016)

1,354 views

8 years ago

Computational Thinking
Vertex Cover Approximation

In this video, we discuss the vertex cover problem. In particular we show that Vertex Cover can be 2-approximated.

6:04
Vertex Cover Approximation

7,879 views

3 years ago

Algorithms Lab
Approximation Algorithm for Multiway Cut

The Multiway Cut Problem generalized the Min-s-t-Cut Problem to more than two terminals. In this video I present a ...

12:45
Approximation Algorithm for Multiway Cut

1,598 views

2 years ago

CSBreakdown
Introduction to Approximation Algorithms - K Center Problem

We introduce the topic of approximation algorithms by going over the K-Center Problem.

10:38
Introduction to Approximation Algorithms - K Center Problem

58,453 views

10 years ago

Algorithms Lab
Approximation Algorithms: Introduction by the Example of Vertex Cover

This is the first video in a series on approximation algorithms. I briefly review the basic underlying concepts and then take a look at ...

23:07
Approximation Algorithms: Introduction by the Example of Vertex Cover

11,671 views

2 years ago

Computational Thinking
Bin Packing Approximation

In this video, we discuss the Bin Packing problem. We show that Bin Packing allows for a 1.5-approximation. We also present a ...

6:21
Bin Packing Approximation

27,764 views

3 years ago

CodeLucky
Approximation Algorithms: Solving NP-hard Problems Efficiently!

Learn about Approximation Algorithms, your secret weapon for tackling NP-hard problems! This video breaks down complex ...

5:56
Approximation Algorithms: Solving NP-hard Problems Efficiently!

254 views

6 months ago

Tim Roughgarden Lectures
A Second Course in Algorithms (Lecture 15: Introduction to Approximation Algorithms)

Introduction to approximation algorithms. Scheduling, knapsack, Steiner tree, set coverage, influence maximization. Full course ...

1:19:56
A Second Course in Algorithms (Lecture 15: Introduction to Approximation Algorithms)

3,620 views

9 years ago

From related searches

Computer Science Theory Explained
Algorithmic Game Theory - Introduction
4:38
Algorithmic Game Theory - Introduction

8,349 views

4 years ago

Machine Learnia
HOW DOES MACHINE LEARNING WORK?

Machine learning is all around you. Machine learning algorithms and neural networks power YouTube, Google, Amazon, Facebook ...

19:18
HOW DOES MACHINE LEARNING WORK?

94,526 views

6 years ago

ByteByteGo
Concurrency Vs Parallelism!

Get a Free System Design PDF with 158 pages by subscribing to our weekly newsletter: https://bit.ly/bytebytegoytTopic Animation ...

4:13
Concurrency Vs Parallelism!

175,248 views

1 year ago

Computational Thinking
Traveling Salesperson Problem Approximation

In this video, we study the traveling salesperson problem. We present a simple 2-approximation for the metric Traveling ...

8:03
Traveling Salesperson Problem Approximation

9,959 views

3 years ago

Dr. Will Wood
Minimax Approximation and the Exchange Algorithm

In this video we'll discuss minimax approximation. This is a method of approximating functions by minimisation of the infinity ...

12:08
Minimax Approximation and the Exchange Algorithm

17,003 views

2 years ago

Living Science
P, NP and Approximation Algorithms: Prof. Naveen Garg, IIT-Delhi

This is a short lecture on "The P versus NP problem" by Prof. Naveen Garg of Computer Science department at the IIT-Delhi.

41:04
P, NP and Approximation Algorithms: Prof. Naveen Garg, IIT-Delhi

51,110 views

8 years ago