The Clever Shopper Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F20%3A00337774" target="_blank" >RIV/68407700:21240/20:00337774 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s00224-019-09917-z" target="_blank" >https://doi.org/10.1007/s00224-019-09917-z</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00224-019-09917-z" target="_blank" >10.1007/s00224-019-09917-z</a>
Alternative languages
Result language
angličtina
Original language name
The Clever Shopper Problem
Original language description
We investigate a variant of the so-called Internet Shopping problem introduced by Blazewicz et al. (Appl. Math. Comput. Sci. 20, 385–390, 2010), where a customer wants to buy a list of products at the lowest possible total cost from shops which offer discounts when purchases exceed a certain threshold. Although the problem is NP-hard, we provide exact algorithms for several cases, e.g. when each shop sells only two items, and an FPT algorithm for the number of items, or for the number of shops when all prices are equal. We complement each result with hardness proofs in order to draw a tight boundary between tractable and intractable cases. Finally, we give an approximation algorithm and hardness results for the problem of maximising the sum of discounts.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theory of Computing Systems
ISSN
1432-4350
e-ISSN
1433-0490
Volume of the periodical
64
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
18
Pages from-to
17-34
UT code for WoS article
000511677200003
EID of the result in the Scopus database
2-s2.0-85064730286