scientific article

zbMATH Open0769.68043MaRDI QIDQ4036607FDOQ4036607

Zvi Galil, Olded Margalit

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

almost linear-time algorithmdense subset-sum problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited In (7)

• Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks
• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• An Average-Case Sublinear Exact Li and Stephens Forward Algorithm
• Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum
• 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

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)