On the equal-subset-sum problem
From MaRDI portal
Recommendations
Cites work
Cited in
(36)- Shifted varieties and discrete neighborhoods around varieties
- Faster algorithms for \(k\)-subset sum and variations
- Efficient approximation algorithms for the subset-sums equality problem.
- ABOUT THE CONP-COMPLETE “INJECTIVE KNAPSACK” PROBLEM
- Classical and quantum algorithms for variants of subset-sum via dynamic programming
- The $k$ -Equal Problem
- On the hardness of finding subsets with equal average
- Simple FPTAS for the subset-sums ratio problem
- Approximating subset sum ratio via subset sum computations
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- Matrix semigroup freeness problems in \(\mathrm{SL}(2,\mathbb {Z})\)
- Vector ambiguity and freeness problems in \(\mathrm{SL} (2,\mathbb {Z})\)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization
- Subset sum problems with digraph constraints
- Approximation schemes for subset-sums ratio problems
- Preprocessing and cut generation techniques for multi-objective binary programming
- Fair draws for group rounds in sport tournaments
- Composing equipotent teams.
- Envy-free revenue approximation for asymmetric buyers with budgets
- On envy-free revenue approximation for combinatorial buyers with budgets
- Some algorithmic results for [2]-sumset covers
- scientific article; zbMATH DE number 7456121 (Why is no real title available?)
- scientific article; zbMATH DE number 7525510 (Why is no real title available?)
- Covering a set with arithmetic progressions is NP-complete
- Approximability of the subset sum reconfiguration problem
- On vertex-weighted realizations of acyclic and general graphs
- On vertex-weighted graph realizations
- On the complexity of variations of equal sum subsets
- Partial digest is hard to solve for erroneous input data
- Polynomially Ambiguous Probabilistic Automata on Restricted Languages
- Motion planning with pulley, rope, and baskets
- Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
- One-dimensional stock cutting resilient against singular random defects
- Approximating subset sum ratio via partition computations
- Decision problems for some classes of integer partitions and number multisets
- Polynomially ambiguous probabilistic automata on restricted languages
This page was built for publication: On the equal-subset-sum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198083)
