Online knapsack with removal and recourse
From MaRDI portal
(Redirected from Publication:6182898)
Online knapsack with removal and recourse (scientific article; zbMATH DE number 7781730)
Online knapsack with removal and recourse (scientific article; zbMATH DE number 7781730)
Cites work
- Dynamic Steiner Tree Problem
- How Much Information about the Future Is Needed?
- scientific article; zbMATH DE number 2086630 (Why is no real title available?)
- scientific article; zbMATH DE number 7758339 (Why is no real title available?)
- Information complexity of online problems
- On the Advice Complexity of Online Edge- and Node-Deletion Problems
- Online algorithms with advice: the tape model
- Online computation with advice
- Online maximum matching with recourse
- Online node- and edge-deletion problems with advice
- Online Steiner tree with deletions
- Online unweighted knapsack problem with removal cost
- Semi on-line algorithms for the partition problem
- Semi-online scheduling: a survey
- Stochastic on-line knapsack problems
- The advice complexity of a class of hard online problems
- The online knapsack problem: advice and randomization
- The power of deferral: maintaining a constant-competitive Steiner tree online
- The power of recourse for online MST and TSP
Cited in
(5)
This page was built for publication: Online knapsack with removal and recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182898)