Abstract
Abstract We consider the problem of packing the maximal number of unit squares in a hypograph of a function. A polynomial time algorithm is described to solve this problem for a piecewise linear function.
A polynomial algorithm for packing unit squares in a hypograph of a piecewise linear function
2017
How this score is calculated
It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.