Reducing a Target Interval to a Few Exact Queries

DOI10.1007/978-3-642-32589-2_62zbMath1365.68290arXiv1208.4225OpenAlexW2109797885MaRDI QIDQ2912770

Jesper Nederlof, Ruben van der Zwaan, Erik Jan van Leeuwen

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.4225

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (6)

Polynomial kernels for weighted problems ⋮ Knapsack problems: a parameterized point of view ⋮ A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Unnamed Item ⋮ Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems ⋮ Hardness of approximation for knapsack problems

This page was built for publication: Reducing a Target Interval to a Few Exact Queries