Online knapsack with removal and recourse

DOI10.1007/978-3-031-34347-6_11OpenAlexW4379118066MaRDI QIDQ6182898

Hans-Joachim Böckenhauer, David Wehner, Ralf Klasing, Peter Rossmanith, Moritz Stocker, Tobias Mömke

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_11

zbMATH Keywords

online knapsacksemi-online algorithmrecourseproportional knapsack

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Online unweighted knapsack problem with removal cost
• Online algorithms with advice: the tape model
• Online computation with advice
• Online maximum matching with recourse
• Semi on-line algorithms for the partition problem
• The advice complexity of a class of hard online problems
• Stochastic on-line knapsack problems
• Online node- and edge-deletion problems with advice
• The online knapsack problem: advice and randomization
• Semi-online scheduling: a survey
• The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
• Information Complexity of Online Problems
• Dynamic Steiner Tree Problem
• Online Steiner Tree with Deletions
• How Much Information about the Future Is Needed?
• The Power of Recourse for Online MST and TSP
• Relaxing the irrevocability requirement for online graph algorithms
• On the Advice Complexity of Online Edge- and Node-Deletion Problems

This page was built for publication: Online knapsack with removal and recourse