GANIAN, Robert and Sebastian ORDYNIAK. The complexity landscape of decompositional parameters for ILP. ARTIFICIAL INTELLIGENCE. Elsevier Science, 2018, vol. 257, No 1, p. 61-71. ISSN 0004-3702. Available from: https://dx.doi.org/10.1016/j.artint.2017.12.006.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name The complexity landscape of decompositional parameters for ILP
Authors GANIAN, Robert (203 Czech Republic, guarantor, belonging to the institution) and Sebastian ORDYNIAK (276 Germany).
Edition ARTIFICIAL INTELLIGENCE, Elsevier Science, 2018, 0004-3702.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Impact factor Impact factor: 4.483
RIV identification code RIV/00216224:14330/18:00106822
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.1016/j.artint.2017.12.006
UT WoS 000427335000003
Keywords in English integer linear programming; treewidth; treedepth; parameterized complexity
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 3/5/2019 15:00.
Abstract
Integer Linear Programming (ILP) can be seen as the archetypical problem for NP-complete optimization problems, and a wide range of problems in artificial intelligence are solved in practice via a translation to ILP. Despite its huge range of applications, only few tractable fragments of ILP are known, probably the most prominent of which is based on the notion of total unimodularity. Using entirely different techniques, we identify new tractable fragments of ILP by studying structural parameterizations of the constraint matrix within the framework of parameterized complexity. In particular, we show that ILP is fixed-parameter tractable when parameterized by the treedepth of the constraint matrix and the maximum absolute value of any coefficient occurring in the ILP instance. Together with matching hardness results for the more general parameter treewidth, we give an overview of the complexity of ILP w.r.t. decompositional parameters defined on the constraint matrix.
Links
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 5/9/2024 01:23