Abstract
A greedy algorithm for scheduling and digital printing with inputs in a polytope lying in an affine space, and vertices of this polytope as successive outputs, has recently been proven to be bounded for any polytope in any dimension in the case when the norm on errors is the Euclidean norm. This boundedness property follows readily from the existence of some invariant sets (both in the affine space and in the associated vector space), for the dynamics associated to the algorithm. We prove several general properties of such invariant sets under the assumption that the greed of the algorithm is driven by the Euclidean norm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
