The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
Este curso forma parte de Programa Especializado - Algoritmos
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
ofrecido por
Acerca de este Curso
30,948 vistas recientes
Resultados profesionales del estudiante
62%
comenzó una nueva carrera después de completar estos cursos
50%
consiguió un beneficio tangible en su carrera profesional gracias a este curso
12%
consiguió un aumento de sueldo o ascenso
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 4 de 4 en
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Nivel intermedio
Aprox. 26 horas para completar
Inglés (English)
Subtítulos: Inglés (English)
Habilidades que obtendrás
Data StructureAlgorithmsNp-CompletenessDynamic Programming
Resultados profesionales del estudiante
62%
comenzó una nueva carrera después de completar estos cursos
50%
consiguió un beneficio tangible en su carrera profesional gracias a este curso
12%
consiguió un aumento de sueldo o ascenso
Certificado para compartir
Obtén un certificado al finalizar
100 % en línea
Comienza de inmediato y aprende a tu propio ritmo.
Curso 4 de 4 en
Fechas límite flexibles
Restablece las fechas límite en función de tus horarios.
Nivel intermedio
Aprox. 26 horas para completar
Inglés (English)
Subtítulos: Inglés (English)
ofrecido por
Universidad de Stanford
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Programa - Qué aprenderás en este curso
3 horas para completar
Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.
3 horas para completar
14 videos (Total 151 minutos), 4 lecturas, 2 cuestionarios
14 videos
Optimal Substructure10m
The Basic Algorithm I8m
The Basic Algorithm II10m
Detecting Negative Cycles9m
A Space Optimization12m
Internet Routing I [Optional]11m
Internet Routing II [Optional]6m
Problem Definition7m
Optimal Substructure12m
The Floyd-Warshall Algorithm13m
A Reweighting Technique14m
Johnson's Algorithm I11m
Johnson's Algorithm II11m
4 lecturas
Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture Slides10m
Optional Theory Problems (Week 1)10m
2 ejercicios de práctica
Problem Set #110m
Programming Assignment #12m
3 horas para completar
Week 2
NP-complete problems and exact algorithms for them.
3 horas para completar
11 videos (Total 122 minutos), 2 lecturas, 2 cuestionarios
11 videos
Reductions and Completeness13m
Definition and Interpretation of NP-Completeness I10m
Definition and Interpretation of NP-Completeness II7m
The P vs. NP Question9m
Algorithmic Approaches to NP-Complete Problems12m
The Vertex Cover Problem8m
Smarter Search for Vertex Cover I9m
Smarter Search for Vertex Cover II7m
The Traveling Salesman Problem14m
A Dynamic Programming Algorithm for TSP12m
2 lecturas
Week 2 Overview10m
Optional Theory Problems (Week 2)10m
2 ejercicios de práctica
Problem Set #210m
Programming Assignment #22m
2 horas para completar
Week 3
Approximation algorithms for NP-complete problems.
2 horas para completar
6 videos (Total 68 minutos), 1 lectura, 2 cuestionarios
6 videos
Analysis of a Greedy Knapsack Heuristic I7m
Analysis of a Greedy Knapsack Heuristic II9m
A Dynamic Programming Heuristic for Knapsack11m
Knapsack via Dynamic Programming, Revisited10m
Ananysis of Dynamic Programming Heuristic15m
1 lectura
Week 3 Overview10m
2 ejercicios de práctica
Problem Set #310m
Programming Assignment #32m
3 horas para completar
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
3 horas para completar
11 videos (Total 124 minutos), 3 lecturas, 3 cuestionarios
11 videos
The Maximum Cut Problem II9m
Principles of Local Search I8m
Principles of Local Search II10m
The 2-SAT Problem14m
Random Walks on a Line16m
Analysis of Papadimitriou's Algorithm14m
Stable Matching [Optional]15m
Matchings, Flows, and Braess's Paradox [Optional]13m
Linear Programming and Beyond [Optional]11m
Epilogue1m
3 lecturas
Week 4 Overview10m
Optional Theory Problems (Week 4)10m
Info and FAQ for final exam10m
3 ejercicios de práctica
Problem Set #410m
Programming Assignment #42m
Final Exam20m
Revisiones
Principales revisiones sobre SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
por AAFeb 27, 2017
This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.
por ASAug 22, 2018
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.\n\nOne of the best courses I did on Coursera.
por MLNov 12, 2019
very interesting course in Algorithms Specialization.\n\nIt is sufficient to arouse interest in studying advance algorithm.\n\nThank you for your teaching, Professor Tim.
por JEDec 27, 2019
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
por KADec 13, 2019
Great course, great explanation from instructor. I loved how Tim Roughgarden explains algorithms. Course Load was just right for me. Great experience!
por JFJan 13, 2018
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
por LCMay 1, 2018
Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!
por SAMar 15, 2020
A really well-crafted specialization. Has something for everyone from a beginner to an advanced Computer Science student.
por YWMar 3, 2018
unlike previous 3 courses\n\nsome of course 4's quiz problems are really difficult and not sure how to approach...
por ASFeb 25, 2019
Nice course, a lot of information in short time. I think is need more time than 4 weeks to finish this course.
por XNov 30, 2019
Great course in general, got the chance to dive a little deeper into the world of computer science.
por PRJun 24, 2018
Great one for people with advanced understanding! Others will find it slightly hard to follow!
Acerca de Programa especializado Algoritmos
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.
About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.
Preguntas Frecuentes
¿Cuándo podré acceder a las lecciones y tareas?
Una vez que te inscribes para obtener un Certificado, tendrás acceso a todos los videos, cuestionarios y tareas de programación (si corresponde). Las tareas calificadas por compañeros solo pueden enviarse y revisarse una vez que haya comenzado tu sesión. Si eliges explorar el curso sin comprarlo, es posible que no puedas acceder a determinadas tareas.
¿Qué recibiré si me suscribo a este Programa especializado?
Cuando te inscribes en un curso, obtienes acceso a todos los cursos que forman parte del Programa especializado y te darán un Certificado cuando completes el trabajo. Se añadirá tu Certificado electrónico a la página Logros. Desde allí, puedes imprimir tu Certificado o añadirlo a tu perfil de LinkedIn. Si solo quieres leer y visualizar el contenido del curso, puedes auditar el curso sin costo.
¿Cuál es la política de reembolsos?
¿Hay ayuda económica disponible?
¿Tienes más preguntas? Visita el Centro de Ayuda al Alumno.
