On the equal-subset-sum problem
From MaRDI portal
Publication:1198083
DOI10.1016/0020-0190(92)90226-LzbMath0772.68059OpenAlexW2127492079MaRDI QIDQ1198083
Zhongliang Yu, Gerhard J. Woeginger
Publication date: 16 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90226-l
Related Items (25)
Polynomially ambiguous probabilistic automata on restricted languages ⋮ Shifted varieties and discrete neighborhoods around varieties ⋮ Subset sum problems with digraph constraints ⋮ Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix ⋮ Approximation schemes for subset-sums ratio problems ⋮ Approximating subset sum ratio via subset sum computations ⋮ Motion planning with pulley, rope, and baskets ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ Fair draws for group rounds in sport tournaments ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ Faster algorithms for \(k\)-\textsc{Subset Sum} and variations ⋮ Cutting stock with no three parts per pattern: work-in-process and pattern minimization ⋮ On vertex-weighted graph realizations ⋮ Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$ ⋮ Simple FPTAS for the subset-sums ratio problem ⋮ Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$ ⋮ ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ Unnamed Item ⋮ On envy-free revenue approximation for combinatorial buyers with budgets ⋮ Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets ⋮ Polynomially Ambiguous Probabilistic Automata on Restricted Languages ⋮ Faster algorithms for \(k\)-subset sum and variations ⋮ Efficient approximation algorithms for the subset-sums equality problem. ⋮ Partial digest is hard to solve for erroneous input data
Cites Work
This page was built for publication: On the equal-subset-sum problem
