Approximating subset sum ratio via partition computations
From MaRDI portal
Publication:6541032
DOI10.1007/S00236-023-00451-7MaRDI QIDQ6541032
Giannis Alonistiotis, Antonis Antonopoulos, Manolis Vasilakis, Stavros Petsalakis, Aris Pagourtzis, Nikolaos Melissinos
Publication date: 17 May 2024
Published in: Acta Informatica (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the equal-subset-sum problem
- On the complexity of the parity argument and other inefficient proofs of existence
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Efficient approximation algorithms for the subset-sums equality problem.
- A faster FPTAS for the subset-sums ratio problem
- Faster algorithms for \(k\)-subset sum and variations
- Approximation schemes for subset-sums ratio problems
- Approximating subset sum ratio via subset sum computations
- Simple FPTAS for the subset-sums ratio problem
- Computing Partitions with Applications to the Knapsack Problem
- A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
- Dense Subset Sum may be the hardest
- On Problems Equivalent to (min,+)-Convolution
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Reducibility among Combinatorial Problems
- Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
- A Subquadratic Approximation Scheme for Partition
- Fundamentals of Computation Theory
- LATIN 2004: Theoretical Informatics
- SETH-based Lower Bounds for Subset Sum and Bicriteria Path
- Algebraic algorithms for variants of subset sum
- Approximating Knapsack and partition via dense subset sums
- A simple near-linear pseudopolynomial time randomized algorithm for subset sum
This page was built for publication: Approximating subset sum ratio via partition computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541032)
