Lise AndreasenJun 24, 2025

#ThisWeeksFiddler, 20250620
This week the #puzzle is: How Greedily Can You Mow the Lawn? #geometry #area #volume #GreedyAlgorithm (Link at the bottom.) You’re mowing a circular lawn with a radius of 1 unit. You can mow in straight strips that are 1 unit wide. The fewest number of passes you would need to mow the entire lawn […]

https://stuff.ommadawn.dk/2025/06/24/thisweeksfiddler-20250620/

#ThisWeeksFiddler, 20250620

This week the #puzzle is: How Greedily Can You Mow the Lawn? #geometry #area #volume #GreedyAlgorithm (Link at the bottom.) You’re mowing a circular lawn with a radius of 1 unit. You can mow in str…

Stuff from ommadawn.dk (Lise Andreasen)
Mohammad HajiaghayiJun 1, 2023

Now (7pm ET Wed) watch https://youtu.be/AVBwSqH01L0 (FEEL FREE TO SUBSCRIBE TO YOUTUBE
@hajiaghayi

FOR FUTURE LESSONS) Lesson 21: Introduction to Algorithms by Mohammad Hajiaghayi: In this session, we talk about #DP, #Memoization,#ApproximationAlgorithm, #GreedyAlgorithm, #Backtracking

Lesson 21: Introduction to Algorithms by Mohammad Hajiaghayi: Memoization & Approximation Algorithms

YouTube
Mohammad HajiaghayiMay 25, 2023

Now (7pm ET Wed) watch https://youtu.be/sfOkJ8n5Qjs (FEEL FREE TO SUBSCRIBE TO YOUTUBE
@hajiaghayi

FOR FUTURE LESSONS) Lesson 20: Introduction to Algorithms by Mohammad Hajiaghayi: We talk about #GreedyAlgorithm, #Backtracking, #DynamicProgramming, #DP: differences & similarities

Lesson 20: Introduction to Algorithms by Mohammad Hajiaghayi: Greedy, Backtracking, Dynamic Program

YouTube
xameerMay 2, 2021
#greedyalgorithm can be used to find a max-weight basis of #matroid, by starting from empty set and repeatedly adding one element at a time, at each step choosing a max-weight element among elements whose addition would preserve the independence of the augmented set
xameerDec 13, 2020
let u be min odd number \geq y/x, include the fraction 1/u in expansion, and continue in same way with remaining fraction x/y − 1/u. This method is called odd #greedyalgorithm and the expansions it creates are called odd greedy expansions.
xameerDec 13, 2020
let u be min odd number \geq y/x, include the fraction 1/u in expansion, and continue in same way with remaining fraction x/y − 1/u. This method is called odd #greedyalgorithm and the expansions it creates are called odd greedy expansions.
xameerNov 23, 2020
Earth Mover Distance may be computed exactly using a #greedyalgorithm, and the resulting functional has been shown to be #Minkowski additive and #convex monotone
xameerNov 23, 2020
Earth Mover Distance may be computed exactly using a #greedyalgorithm, and the resulting functional has been shown to be #Minkowski additive and #convex monotone