On-line computation and maximum-weighted hereditary subgraph problems

DOI10.2298/YJOR1101011DMaRDI QIDQ2853213zbMATH OpenOpenAlexFDO

Authors Marc Demange, Bernard Kouakou, Éric Soutif

Publication date 18 October 2013

Published in YUJOR. Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/yjor1101011d

zbMATH Keywords

online algorithmscompetitive ratioindependent sethereditary property

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Algorithms and Computation
• On-line maximum-order induced hereditary subgraph problems
• scientific article; zbMATH DE number 2079869
• Reducing off-line to on-line: An example and its applications
• Advice complexity of the online induced subgraph problem

Cited in

(5)

• Reducing off-line to on-line: An example and its applications
• Algorithms and Computation
• On-line maximum-order induced hereditary subgraph problems
• scientific article; zbMATH DE number 2079869 (Why is no real title available?)
• Reoptimization of maximum weight induced hereditary subgraph problems

This page was built for publication: On-line computation and maximum-weighted hereditary subgraph problems

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