Advice complexity of priority algorithms

DOI10.1007/978-3-030-04693-4_5MaRDI QIDQ6830235zbMATH OpenFDO

Authors Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov

Publication date 15 January 2019

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

Full work available at URL http://portal.findresearcher.sdu.dk/da/publications/f2d2071a-6f52-40f0-a9e4-729ace02653f

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Advice complexity of priority algorithms

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