Subset sum problems with digraph constraints
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0262-1
Abstract: We introduce and study optimization problems which are related to the well-known Subset Sum problem. In each new problem, a node-weighted digraph is given and one has to select a subset of vertices whose total… read more here.
Keywords: subset sum; digraph constraints; problems digraph; sum problems ... See more keywords
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;