Parameterized complexity of sparse linear complementarity problems
DOI10.1007/S00453-016-0229-5zbMATH Open1372.68148OpenAlexW2533634545MaRDI QIDQ2408196FDOQ2408196
Authors: Hanna Sumita, Naonori Kakimura, Kazuhisa Makino 
Publication date: 10 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5596/
Recommendations
- Parameterized complexity of sparse linear complementarity problems
- Sparse Linear Complementarity Problems
- Sparse solutions of linear complementarity problems
- Sparse parameterized problems
- Approximation Bounds for Sparse Programs
- On the complexity of sparse elimination
- On the parametric linear complementarity problem
- Approximability of Sparse Integer Programs
- Approximability of sparse integer programs
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- On problems without polynomial kernels
- Parametrized complexity theory.
- Complementary pivot theory of mathematical programming
- Bimatrix Equilibrium Points and Mathematical Programming
- On polynomial kernels for sparse integer linear programs
- On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
- On Kernels for Covering and Packing ILPs with Small Coefficients
- Title not available (Why is that?)
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Settling the complexity of computing two-player Nash equilibria
- Solving linear equations parameterized by Hamming weight
- NP-completeness of the linear complementarity problem
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Nash and correlated equilibria: Some complexity considerations
- Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
- On oblivious PTAS's for nash equilibrium
- Parameterized two-player Nash equilibrium
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
- Title not available (Why is that?)
- The Linear Complementarity Problems with a Few Variables per Constraint
Cited In (2)
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 Q2408196)
