Everything about Largest differencing method

🧭 Start here: a 6-step reading path

1. Read the overview: Largest differencing methodA 5-minute orientation
2. Go sideways: Balanced number partitioningA closely related topic
3. Go sideways: Partition problemA closely related topic

🏆 Landmark papers (most cited)

• No matching papers found.

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Balanced number partitioning Balanced number partitioning is a variant of multiway number partitioning in which there are constraints on the number of items allocated to each set.…
• Partition problem In number theory and computer science, the partition problem, or number partitioning, is the task of deciding whether a given multiset S of positive integers…
• Multiway number partitioning In computer science, multiway number partitioning is the problem of partitioning a multiset of numbers into a fixed number of subsets, such that the sums…
• Greedy number partitioning In computer science, greedy number partitioning is a class of greedy algorithms for multiway number partitioning. The input to the algorithm is a set S…
• Longest-processing-time-first scheduling Longest-processing-time-first (LPT) is a greedy algorithm for job scheduling. The input to the algorithm is a set of jobs, each of which has a specific…
• Karmarkar–Karp bin packing algorithms The Karmarkar–Karp (KK) bin packing algorithms are several related approximation algorithm for the bin packing problem. The bin packing problem is a problem…
• Matroid partitioning Matroid partitioning is a problem arising in the mathematical study of matroids and in the design and analysis of algorithms. Its goal is to partition…
• Cutwidth In graph theory, the cutwidth of an undirected graph is the smallest integer k {\displaystyle k} with the following property: there is an ordering of the…