Unit cost buyback problem

DOI10.1007/S00224-018-9897-7zbMATH Open1422.91389OpenAlexW4235876023MaRDI QIDQ2322706FDOQ2322706

Kazuhisa Makino, Yasushi Kawase, Xin Han

Publication date: 5 September 2019

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-018-9897-7

zbMATH Keywords

competitive analysisknapsack problemmatroidonline algorithmbuyback problem

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Online removable knapsack problem under convex function
• Optimal Resource Augmentations for Online Knapsack
• Randomized algorithms for online knapsack problems
• Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
• Online unweighted knapsack problem with removal cost
• Online minimization knapsack problem
• Buyback problem with discrete concave valuation functions
• Unit Cost Buyback Problem
• Proportional Cost Buyback Problem with Weight Bounds

Cited In (1)

• Proportional Cost Buyback Problem with Weight Bounds

This page was built for publication: Unit cost buyback problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322706)