Change-making problems revisited: a parameterized point of view
type: Item
instance of: scholarly article
title: Change-making problems revisited: a parameterized point of view
zbMATH Open document ID: 1373.90168
author: Frank Gurski
author: Jochen Rethmann
author: Eda Yilmaz
author: Steffen J. Goebbels
published in: Journal of Combinatorial Optimization
publication date: 2017-11-09T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6804426
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: kernelization
zbMATH Keywords: combinatorial optimization
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s10878-017-0143-z
OpenAlex ID: W2619212074
cites work: Combinatorics of the change-making problem
cites work: Kernelization: New Upper and Lower Bound Techniques
cites work: A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
cites work: When the Greedy Solution Solves a Class of Knapsack Problems
cites work: Algorithmic Solution of the Change-Making Problem
cites work: Totally greedy coin sets and greedy obstructions
cites work: Parameterized Algorithms
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: Q4393480
cites work: Fundamentals of parameterized complexity
cites work: Polynomial kernels for weighted problems
cites work: Q4279511
cites work: Parametrized complexity theory.
cites work: An application of simultaneous diophantine approximation in combinatorial optimization
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: Reducibility among Combinatorial Problems
cites work: A Faster Pseudopolynomial Time Algorithm for Subset Sum
cites work: Q3993418
cites work: Q5710169
cites work: A polynomial-time algorithm for the change-making problem
cites work: Linear Time Algorithms for Knapsack Problems with Bounded Weights
cites work: The Change-Making Problem
DOI: 10.1007/S10878-017-0143-Z
description: scientific article; zbMATH DE number 6804426