Further results on online node- and edge-deletion problems with advice

DOI10.1007/978-3-030-48966-3_11MaRDI QIDQ5041186zbMATH OpenOpenAlexFDO

Authors Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

Publication date 13 October 2022

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

Full work available at URL https://doi.org/10.1007/978-3-030-48966-3_11

zbMATH Keywords

advice complexitydelayed decision modeledge deletiongraph modificationnode deletiononline algorithm

Mathematics Subject Classification ID

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

Recommendations

• Online node- and edge-deletion problems with advice
• On the Advice Complexity of Online Edge- and Node-Deletion Problems
• Advice complexity of the online induced subgraph problem
• Advice complexity for a class of online problems
• Independent set with advice: the impact of graph knowledge (extended abstract)

Cites work

• Advice complexity of the online induced subgraph problem
• scientific article; zbMATH DE number 193017 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Information complexity of online problems
• Mathematics for the Analysis of Algorithms.
• Measuring the problem-relevant information in input
• Node-and edge-deletion NP-complete problems
• On the Advice Complexity of Online Edge- and Node-Deletion Problems
• On the Advice Complexity of Online Problems
• On-line vertex-covering
• Online algorithms with advice: the tape model
• Online computation with advice
• The online knapsack problem: advice and randomization

Cited in

(2)

• Online node- and edge-deletion problems with advice
• On the Advice Complexity of Online Edge- and Node-Deletion Problems

This page was built for publication: Further results on online node- and edge-deletion problems with advice

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