Reducing a Target Interval to a Few Exact Queries

@article{Nederlof2012ReducingAT,
  title={Reducing a Target Interval to a Few Exact Queries},
  author={Jesper Nederlof and Erik Jan van Leeuwen and Ruben van der Zwaan},
  journal={ArXiv},
  year={2012},
  volume={abs/1208.4225}
}
  • Jesper Nederlof, Erik Jan van Leeuwen, Ruben van der Zwaan
  • Published 2012
  • Mathematics, Computer Science
  • ArXiv
  • Many combinatorial problems involving weights can be formulated as a so-called ranged problem. That is, their input consists of a universe U, a (succinctly-represented) set family $\mathcal{F} \subseteq 2^{U}$, a weight function ω:U→{1,…,N}, and integers 0≤l≤u≤∞. Then the problem is to decide whether there is an $X \in \mathcal{F}$ such that l≤∑e∈Xω(e)≤u. Well-known examples of such problems include Knapsack, Subset Sum, Maximum Matching, and Traveling Salesman. In this paper, we develop a… CONTINUE READING

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 21 CITATIONS

    Subquadratic Approximation Scheme for Partition

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    SETH-Based Lower Bounds for Subset Sum and Bicriteria Path

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Faster space-efficient algorithms for subset sum and k-sum

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    FILTER CITATIONS BY YEAR

    2013
    2020

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES

    Determinant Sums for Undirected Hamiltonicity

    VIEW 1 EXCERPT

    Random knapsack in expected polynomial time

    VIEW 1 EXCERPT

    Saving space by algebraization

    VIEW 1 EXCERPT

    On the Compressibility of NP Instances and Cryptographic Applications

    • Danny Harnik, Moni Naor
    • Computer Science, Mathematics
    • 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
    • 2006
    VIEW 3 EXCERPTS

    On problems without polynomial kernels

    VIEW 2 EXCERPTS

    A T=O(2n/2), S=O(2n/4) Algorithm for Certain NP-Complete Problems

    VIEW 1 EXCERPT

    Kernelization: New Upper and Lower Bound Techniques

    VIEW 2 EXCERPTS