Change-making problems revisited: a parameterized point of view (Q1679517): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Combinatorics of the change-making problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization: New Upper and Lower Bound Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: When the Greedy Solution Solves a Class of Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Solution of the Change-Making Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally greedy coin sets and greedy obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for weighted problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Pseudopolynomial Time Algorithm for Subset Sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for the change-making problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Change-Making Problem / rank
 
Normal rank

Latest revision as of 16:21, 14 July 2024

scientific article
Language Label Description Also known as
English
Change-making problems revisited: a parameterized point of view
scientific article

    Statements

    Change-making problems revisited: a parameterized point of view (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    fixed-parameter tractability
    0 references
    kernelization
    0 references
    combinatorial optimization
    0 references

    Identifiers