IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v34y2017i4d10.1007_s10878-017-0143-z.html
   My bibliography  Save this article

Change-making problems revisited: a parameterized point of view

Author

Listed:
  • Steffen Goebbels

    (Niederrhein University of Applied Sciences)

  • Frank Gurski

    (University of Düsseldorf)

  • Jochen Rethmann

    (Niederrhein University of Applied Sciences)

  • Eda Yilmaz

    (University of Düsseldorf)

Abstract

The change-making problem is the problem of representing a given amount of money with the fewest number of coins possible from a given set of coin denominations. In the general version of the problem, an upper bound for the availability of every coin value is given. Even the special case, where for each value an unlimited number of coins is available, is NP-hard. Since in the original problem some amounts can not be represented, especially if no coin of value one exists, we introduce generalized problems that look for approximations of the given amount such that a cost function is minimized. We recall algorithms for the change-making problem and present new algorithms for the generalized version of the problem. Motivated by the NP-hardness we study fixed-parameter tractability of all these problems. We show that some of these problems are fixed-parameter tractable and that some are $$\hbox {W}[1]$$ W [ 1 ] -hard. In order to show the existence of polynomial and constant-size kernels we prove some general results and apply them to several parameterizations of the change-making problems.

Suggested Citation

  • Steffen Goebbels & Frank Gurski & Jochen Rethmann & Eda Yilmaz, 2017. "Change-making problems revisited: a parameterized point of view," Journal of Combinatorial Optimization, Springer, vol. 34(4), pages 1218-1236, November.
    • Handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0143-z
    DOI: 10.1007/s10878-017-0143-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-017-0143-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-017-0143-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ravi Kannan, 1987. "Minkowski's Convex Body Theorem and Integer Programming," Mathematics of Operations Research, INFORMS, vol. 12(3), pages 415-440, August.
    2. T. C. Hu & M. L. Lenard, 1976. "Technical Note—Optimality of a Heuristic Solution for a Class of Knapsack Problems," Operations Research, INFORMS, vol. 24(1), pages 193-196, February.
    3. M. J. Magazine & G. L. Nemhauser & L. E. Trotter, 1975. "When the Greedy Solution Solves a Class of Knapsack Problems," Operations Research, INFORMS, vol. 23(2), pages 207-217, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chen, Lin & Ye, Deshi & Zhang, Guochuan, 2018. "Parallel machine scheduling with speed-up resources," European Journal of Operational Research, Elsevier, vol. 268(1), pages 101-112.
    2. DePaolo, Concetta A. & Rader, David Jr., 2007. "A heuristic algorithm for a chance constrained stochastic program," European Journal of Operational Research, Elsevier, vol. 176(1), pages 27-45, January.
    3. Karthekeyan Chandrasekaran & László A. Végh & Santosh S. Vempala, 2016. "The Cutting Plane Method is Polynomial for Perfect Matchings," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 23-48, February.
    4. Mathur, Kamlesh & Venkateshan, Prahalad, 2007. "A new lower bound for the linear knapsack problem with general integer variables," European Journal of Operational Research, Elsevier, vol. 178(3), pages 738-754, May.
    5. Niclas Boehmer & Edith Elkind, 2020. "Stable Roommate Problem with Diversity Preferences," Papers 2004.14640, arXiv.org.
    6. Yamamoto, Ken, 2014. "Fractal patterns related to dividing coins," Chaos, Solitons & Fractals, Elsevier, vol. 66(C), pages 51-57.
    7. Deineko, Vladimir G. & Woeginger, Gerhard J., 2011. "Unbounded knapsack problems with arithmetic weight sequences," European Journal of Operational Research, Elsevier, vol. 213(2), pages 384-387, September.
    8. Klaus Jansen & Kim-Manuel Klein & José Verschae, 2020. "Closing the Gap for Makespan Scheduling via Sparsification Techniques," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1371-1392, November.
    9. Klaus Jansen & Roberto Solis-Oba, 2011. "A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 743-753, November.
    10. Richard Engelbrecht-Wiggans, 1977. "The Greedy Heuristic Applied to a Class of Set Partitioning and Subset Selection Problems," Cowles Foundation Discussion Papers 469, Cowles Foundation for Research in Economics, Yale University.
    11. Matthias Bentert & Robert Bredereck & Péter Györgyi & Andrzej Kaczmarczyk & Rolf Niedermeier, 2023. "A multivariate complexity analysis of the material consumption scheduling problem," Journal of Scheduling, Springer, vol. 26(4), pages 369-382, August.
    12. William Cook & Thomas Rutherford & Herbert E. Scarf & David F. Shallcross, 1991. "An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming," Cowles Foundation Discussion Papers 990, Cowles Foundation for Research in Economics, Yale University.
    13. D. V. Gribanov & D. S. Malyshev & P. M. Pardalos & S. I. Veselov, 2018. "FPT-algorithms for some problems related to integer programming," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1128-1146, May.
    14. A. Yu. Chirkov & D. V. Gribanov & D. S. Malyshev & P. M. Pardalos & S. I. Veselov & N. Yu. Zolotykh, 2019. "On the complexity of quasiconvex integer minimization problem," Journal of Global Optimization, Springer, vol. 73(4), pages 761-788, April.
    15. Phablo F. S. Moura & Matheus J. Ota & Yoshiko Wakabayashi, 2023. "Balanced connected partitions of graphs: approximation, parameterization and lower bounds," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-27, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0143-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.