Chapter
The Shortest Distance Between Two Circles
03:45 - 18:49 (15:03)
Michael Rabin shares a story about a problem he encountered as a young student - finding the shortest distance between two non-overlapping circles - and the solution he discovered. It turns out that the straight line between the two centers of the circles provides the shortest distance, as any other line connecting the circles would be on a longer path.
Clips
Michael Rabin recalls an experience in which he learned about finding the shortest distance between two non-overlapping circles.
03:45 - 09:35 (05:49)
Summary
Michael Rabin recalls an experience in which he learned about finding the shortest distance between two non-overlapping circles. The straight line between the two centers is the shortest path between the two circles.
ChapterThe Shortest Distance Between Two Circles
Episode#111 – Richard Karp: Algorithms and Computational Complexity
PodcastLex Fridman Podcast
In this podcast episode, the guest discusses the importance of visualization in solving algorithms and combinatorial problems, and provides insights on how to develop solutions that run at a certain complexity.
09:35 - 13:09 (03:33)
Summary
In this podcast episode, the guest discusses the importance of visualization in solving algorithms and combinatorial problems, and provides insights on how to develop solutions that run at a certain complexity.
ChapterThe Shortest Distance Between Two Circles
Episode#111 – Richard Karp: Algorithms and Computational Complexity
PodcastLex Fridman Podcast
The process of finding what you oversimplified slightly involves subtracting and adding the same constant to rows and columns.
13:10 - 18:49 (05:38)
Summary
The process of finding what you oversimplified slightly involves subtracting and adding the same constant to rows and columns. This can be done while maintaining the property that all elements are non-negative in order to find a solution with the least cost.