Name
Abstract | ||
|---|---|---|
In this paper, we study unit cost buyback problem, i.e., the buyback problem with fixed cancellation cost for each cancelled item. The input is a sequence of elements e1,e2,...,en, each of which has a weight w(ei). We assume that weights have an upper and a lower bound, i.e., l ≤ w(ei) ≤ u for any i. Given the ith element ei, we either accept ei or reject it with no cost, subject to some constraint on the set of accepted elements. In order to accept a new element ei, we could cancel some previous selected elements at a cost which is proportional to the number of elements canceled. Our goal is to maximize the profit, i.e., the sum of the weights of elements accepted (and not canceled) minus the total cancellation cost occurred. We construct optimal online algorithms and prove that they are the best possible, when the constraint is a matroid constraint or the unweighted knapsack constraint. © 2013 Springer-Verlag. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-45030-3_41 | ISAAC |
Field | DocType | Volume |
Matroid,Discrete mathematics,Online algorithm,Combinatorics,Upper and lower bounds,Computer science,Unit cost,Competitive algorithm,Knapsack problem,Competitive analysis | Conference | 8283 LNCS |
Issue | ISSN | Citations |
null | 16113349 | 1 |
PageRank | References | Authors |
0.37 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasushi Kawase | 1 | 42 | 15.31 |
| Xin Han | 2 | 213 | 24.49 |
| Kazuhisa Makino | 3 | 1088 | 102.74 |