On the parameterized intractability of determinant maximization

DOI10.4230/LIPICS.ISAAC.2022.46MaRDI QIDQ6602470zbMATH OpenFDO

Authors Naoto Ohsaka

Publication date 11 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2022.46

zbMATH Keywords

approximabilitydeterminant maximizationparameterized complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• On the parameterized intractability of determinant maximization
• Parameterized inapproximability hypothesis under ETH
• On equivalence of parameterized inapproximability of k-median, k-max-coverage, and 2-CSP

This page was built for publication: On the parameterized intractability of determinant maximization

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