Abstract
We investigate the problem of cutting a given sequence of positive real numbers into p pieces, with the objective of minimizing the L k norm of the sums of the numbers in these pieces. We observe that this problem satisfies a Monge property, and thus derive fast algorithms for it.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
