A deterministic O(log B)-competitive algorithm for online knapsack with positive and negative items, with asymptotically matching lower bound, for transaction admission in PCNs.
17 Alberto Marchetti-Spaccamela and Carlo Vercellis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
A deterministic O(log B)-competitive algorithm for online knapsack with positive and negative items, with asymptotically matching lower bound, for transaction admission in PCNs.