LIPIcs.IPEC.2015.355.pdf
- Filesize: 465 kB
- 10 pages
Document
Parameterized Complexity of Sparse Linear Complementarity Problems
Authors
-
Part of:
Volume:
10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Parameterized and Exact Computation (IPEC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-11-19
Cite AsGet BibTex
Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino. Parameterized Complexity of Sparse Linear Complementarity Problems. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 355-364, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.IPEC.2015.355
https://doi.org/10.4230/LIPIcs.IPEC.2015.355
Abstract
In this paper, we study the parameterized complexity of the linear complementarity problem (LCP), which is one of the most fundamental mathematical optimization problems. The parameters we focus on are the sparsities of the input and the output of the LCP: the maximum numbers of nonzero entries per row/column in the coefficient matrix and the number of nonzero entries in a solution. Our main result is to present a fixed-parameter algorithm for the LCP with all the parameters. We also show that if we drop any of the three parameters, then the LCP is fixed-parameter intractable.
In addition, we discuss the nonexistence of a polynomial kernel for the LCP.
Keywords
- linear complementarity problem
- sparsity
- parameterized complexity
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads