Approximation schemes for subset-sums ratio problems
From MaRDI portal
Recommendations
Cites work
- A faster FPTAS for the subset-sums ratio problem
- A subquadratic approximation scheme for partition
- Algorithms for Scheduling Independent Tasks
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Approximation schemes for a class of subset selection problems
- Composing equipotent teams.
- Computing Partitions with Applications to the Knapsack Problem
- Efficient approximation algorithms for the subset-sums equality problem.
- Equal-subset-sum faster than the meet-in-the-middle
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 3644795 (Why is no real title available?)
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- scientific article; zbMATH DE number 7122316 (Why is no real title available?)
- LATIN 2004: Theoretical Informatics
- On the complexity of the parity argument and other inefficient proofs of existence
- On the complexity of variations of equal sum subsets
- On the equal-subset-sum problem
- Simple FPTAS for the subset-sums ratio problem
- Subset sum problems with digraph constraints
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited in
(5)- Worst-case analysis of an approximation scheme for the subset-sum problem
- Approximability of the Subset Sum Reconfiguration Problem
- Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
- LATIN 2004: Theoretical Informatics
- Approximating subset sum ratio via partition computations
This page was built for publication: Approximation schemes for subset-sums ratio problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2167894)
