scientific article; zbMATH DE number 6846440

DOI10.4230/LIPIcs.ESA.2016.69zbMath1397.68107arXiv1608.03439MaRDI QIDQ4606341

Jesper Nederlof

Publication date: 2 March 2018

Full work available at URL: https://arxiv.org/abs/1608.03439

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

zbMATH Keywords

set coverexact exponential algorithmsfine-grained complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (3)

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Unnamed Item ⋮ Fine-Grained Reductions and Quantum Speedups for Dynamic Programming.

This page was built for publication: