scientific article; zbMATH DE number 176777
From MaRDI portal
Publication:4036607
zbMATH Open0769.68043MaRDI QIDQ4036607FDOQ4036607
Authors: Olded Margalit, Zvi Galil
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
Cited In (15)
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks
- Title not available (Why is that?)
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- STACS 2005
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
- Succinct Certificates for Almost All Subset Sum Problems
- An Average-Case Sublinear Exact Li and Stephens Forward Algorithm
- Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
- A branch bound method for subset sum problem
- Exact algorithms for problems related to the densest \(k\)-set problem
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
- Title not available (Why is that?)
- Dense subset sum may be the hardest
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036607)