scientific article; zbMATH DE number 7650297

From MaRDI portal

Revision as of 05:55, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5875632

Jump to:navigation, search

DOI10.4230/LIPIcs.ISAAC.2019.64MaRDI QIDQ5875632

Barbara Geissmann, Paolo Penna, Guido Proietti, Stefano Leucci, Chih-Hung Liu

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

greedy algorithm matroids approximation algorithms \(p\)-extendible systems high-low energy

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Energy efficient sorting, selection and searching ⋮ Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ Approximate minimum selection with unreliable comparisons

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5875632&oldid=30737989"