Parameterized complexity of sparse linear complementarity problems

DOI10.4230/LIPICS.IPEC.2015.355MaRDI QIDQ5363788zbMATH OpenFDO

Authors Hanna Sumita, Naonori Kakimura, Kazuhisa Makino

Publication date 29 September 2017

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2015.355

zbMATH Keywords

linear complementarity problemparameterized complexitysparsity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Parameterized complexity of sparse linear complementarity problems
• Sparse Linear Complementarity Problems
• The Linear Complementarity Problems with a Few Variables per Constraint
• Sparse parameterized problems
• Sparse solutions of linear complementarity problems

Cited in

(3)

• Parameterized complexity of sparse linear complementarity problems
• Sparse parameterized problems
• Sparse Linear Complementarity Problems

This page was built for publication: Parameterized complexity of sparse linear complementarity problems

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