Approximating Multidimensional Subset Sum and Minkowski Decomposition of Polygons
Sign Up to like & getrecommendations! Published in 2017 at "Mathematics in Computer Science"
DOI: 10.1007/s11786-017-0297-1
Abstract: We consider the approximation of two NP-hard problems: Minkowski decomposition (MinkDecomp) of lattice polygons in the plane and the closely related problem of multidimensional subset sum (kD-SS) in arbitrary dimension. In kD-SS, a multiset S… read more here.
Keywords: minkowski decomposition; subset sum; multidimensional subset;