The Pareto cover problem

DOI10.4230/LIPICS.ESA.2022.80MaRDI QIDQ6969598zbMATH OpenFDO

Authors Bento Natura, Stefan Weltge, Meike Neuwohner

Publication date 19 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2022.80

zbMATH Keywords

approximation algorithmcoveringoptimizationPareto

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• An integer programming approach for linear programs with probabilistic constraints
• Convex Approximations of Chance Constrained Programs
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• The complexity of counting in sparse, regular, and planar graphs

This page was built for publication: The Pareto cover problem

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