Parameterized Complexity of Sparse Linear Complementarity Problems

Hanna Sumita, Naonori Kakimura, Kazuhisa Makino

Research output: Contribution to journalArticle

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 the combined parameter. We also show that if we drop any of the three parameters, then the LCP is NP-hard or W[1]-hard. In addition, we show the nonexistence of a polynomial kernel for the LCP unless coNP (Formula presented.) NP/poly.

Original languageEnglish
Pages (from-to)1-24
Number of pages24
JournalAlgorithmica
DOIs
Publication statusAccepted/In press - 2016 Oct 17
Externally publishedYes

Fingerprint

Parameterized Complexity
Linear Complementarity Problem
Computational complexity
Polynomials
Fixed-parameter Algorithms
Sparsity
Nonexistence
NP-complete problem
kernel
Optimization Problem
Polynomial
Output
Coefficient

Keywords

  • Linear complementarity problem
  • Parameterized complexity
  • Sparsity

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Cite this

Parameterized Complexity of Sparse Linear Complementarity Problems. / Sumita, Hanna; Kakimura, Naonori; Makino, Kazuhisa.

In: Algorithmica, 17.10.2016, p. 1-24.

Research output: Contribution to journalArticle

@article{9aa42b195b624a988453d66926aa8084,
title = "Parameterized Complexity of Sparse Linear Complementarity Problems",
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 the combined parameter. We also show that if we drop any of the three parameters, then the LCP is NP-hard or W[1]-hard. In addition, we show the nonexistence of a polynomial kernel for the LCP unless coNP (Formula presented.) NP/poly.",
keywords = "Linear complementarity problem, Parameterized complexity, Sparsity",
author = "Hanna Sumita and Naonori Kakimura and Kazuhisa Makino",
year = "2016",
month = "10",
day = "17",
doi = "10.1007/s00453-016-0229-5",
language = "English",
pages = "1--24",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",

}

TY - JOUR

T1 - Parameterized Complexity of Sparse Linear Complementarity Problems

AU - Sumita, Hanna

AU - Kakimura, Naonori

AU - Makino, Kazuhisa

PY - 2016/10/17

Y1 - 2016/10/17

N2 - 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 the combined parameter. We also show that if we drop any of the three parameters, then the LCP is NP-hard or W[1]-hard. In addition, we show the nonexistence of a polynomial kernel for the LCP unless coNP (Formula presented.) NP/poly.

AB - 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 the combined parameter. We also show that if we drop any of the three parameters, then the LCP is NP-hard or W[1]-hard. In addition, we show the nonexistence of a polynomial kernel for the LCP unless coNP (Formula presented.) NP/poly.

KW - Linear complementarity problem

KW - Parameterized complexity

KW - Sparsity

UR - http://www.scopus.com/inward/record.url?scp=84991730040&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84991730040&partnerID=8YFLogxK

U2 - 10.1007/s00453-016-0229-5

DO - 10.1007/s00453-016-0229-5

M3 - Article

AN - SCOPUS:84991730040

SP - 1

EP - 24

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

ER -