David Eisenstat questions

David Eisenstat answers

• Grouped Combinations Algorithm
• What is the most performant method to calculate the sum of lcm(i, j), i and j ranging from 1 to k?
• Given n overlapping polygons, how could one get the set that provides the most coverage with the minimum number of polygons
• Most efficient way to find intersections between many sets of numbers
• Prove a property of Minimum Spanning Tree
• Avoiding dead-ends in Battleships random placement algorithm
• How to ensure evaluation order and formal parameter order for named argument lists?
• Divide n people into m groups k times with minimal overlap
• Dynamic (time-indexed) Maximum Flow - Ford-Fulkerson
• Square tiles merging algorithm