Offline and online algorithms for single-minded selling problem (Q2173298): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.03.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3013473015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic pricing for impatient bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Envy-Free Pricing with Metric Substitutability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for unbounded one-way trading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal search and one-way trading online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case competitive analyses for one-way trading / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant competitive algorithms for unbounded one-way trading under monotone hazard rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online pricing for bundles of multiple items / rank
 
Normal rank

Latest revision as of 11:56, 22 July 2024

scientific article
Language Label Description Also known as
English
Offline and online algorithms for single-minded selling problem
scientific article

    Statements

    Offline and online algorithms for single-minded selling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 April 2020
    0 references
    0 references
    NP-hardness
    0 references
    approximation ratio
    0 references
    competitive ratio
    0 references
    single-minded selling
    0 references
    0 references