HTML Microdata document

This HTML5 document contains 42 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n12	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
n16	https://github.com/erelsgl/
rdfs	http://www.w3.org/2000/01/rdf-schema#
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
n13	https://github.com/erelsgl/prtpy/blob/main/prtpy/partitioning/
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbc	http://dbpedia.org/resource/Category:
dbp	http://dbpedia.org/property/
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Envy-graph_procedure
dbo:wikiPageWikiLink: dbr:Greedy_number_partitioning

Subject Item: dbr:Identical-machines_scheduling
dbo:wikiPageWikiLink: dbr:Greedy_number_partitioning

Subject Item: dbr:Partition_problem
dbo:wikiPageWikiLink: dbr:Greedy_number_partitioning

Subject Item: dbr:Largest_differencing_method
dbo:wikiPageWikiLink: dbr:Greedy_number_partitioning

Subject Item: dbr:Greedy_number_partitioning
rdfs:label: Greedy number partitioning
rdfs:comment: 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.
dcterms:subject: dbc:Number_partitioning dbc:Greedy_algorithms
dbo:wikiPageID: 65877107
dbo:wikiPageRevisionID: 1097716510
dbo:wikiPageWikiLink: dbr:Online_algorithm dbc:Number_partitioning dbr:Multiway_number_partitioning dbr:Depth-first_search dbc:Greedy_algorithms dbr:Computer_science dbr:Offline_algorithm dbr:Longest-processing-time-first_scheduling dbr:Maximin_share dbr:List_scheduling dbr:Envy-graph_procedure dbr:Exact_algorithm dbr:LPT_scheduling dbr:Greedy_algorithm dbr:Fair_item_allocation
dbo:wikiPageExternalLink: n13:complete_greedy.py n13:greedy.py n16:prtpy
owl:sameAs: n12:FYGDq wikidata:Q104871767
dbp:wikiPageUsesTemplate: dbt:Reflist dbt:Anchor dbt:Cite_journal
dbo:abstract: 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.
prov:wasDerivedFrom: wikipedia-en:Greedy_number_partitioning?oldid=1097716510&ns=0
dbo:wikiPageLength: 5374
foaf:isPrimaryTopicOf: wikipedia-en:Greedy_number_partitioning

Subject Item: dbr:Longest-processing-time-first_scheduling
dbo:wikiPageWikiLink: dbr:Greedy_number_partitioning

Subject Item: dbr:Multiway_number_partitioning
dbo:wikiPageWikiLink: dbr:Greedy_number_partitioning

Subject Item: dbr:Complete_greedy_algorithm
dbo:wikiPageWikiLink: dbr:Greedy_number_partitioning
dbo:wikiPageRedirects: dbr:Greedy_number_partitioning

Subject Item: wikipedia-en:Greedy_number_partitioning
foaf:primaryTopic: dbr:Greedy_number_partitioning