Greedy number partitioning
id:
greedy-number-partitioning-223-2876406
title:
Greedy number partitioning
text:
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 of numbers, and a parameter k. The required output is a partition of S into k subsets, such that the sums in the subsets are as nearly equal as possible. Greedy algorithms process the numbers sequentially, and insert the next number into a bin in which the sum of numbers is currently smallest.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Greedy_number_partitioning
date created:
2020-11-18T21:32:31Z
date modified:
2024-09-14T13:38:38Z
main entity:
{"identifier":"Q104871767","url":"https://www.wikidata.org/entity/Q104871767"}
image:
fields total:
13
integrity:
14