Parameterized Complexity and Kernel Bounds for Hard Planning Problems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00072819" target="_blank" >RIV/00216224:14330/13:00072819 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-642-38233-8_2" target="_blank" >http://dx.doi.org/10.1007/978-3-642-38233-8_2</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-38233-8_2" target="_blank" >10.1007/978-3-642-38233-8_2</a>

Result language

angličtina

Original language name

Parameterized Complexity and Kernel Bounds for Hard Planning Problems

Original language description

The propositional planning problem is a notoriously difficult computational problem. Downey, Fellows and Stege initiated the parameterized analysis of planning (with plan length as the parameter) and B"{a}ckstr"{o}m et al. picked up this line of research and provided an extensive parameterized analysis under various restrictions, leaving open only one stubborn case. We continue this work and provide a full classification. In particular, we show that the case when actions have no preconditions and at most $e$ postconditions is fixed-parameter tractable if $eleq 2$ and W[1]-complete otherwise. We show fixed-parameter tractability by a reduction to a variant of the Steiner Tree problem; this problem has recently been shown fixed-parameter tractable byGuo, Niedermeier and Suchy. If a problem is fixed-parameter tractable, then it admits a polynomial-time self-reduction to instances whose input size is bounded by a function of the parameter, called the kernel.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BD - Information theory

OECD FORD branch

—

Project

<a href="/en/project/EE2.3.30.0009" target="_blank" >EE2.3.30.0009: Employment of Newly Graduated Doctors of Science for Scientific Excellence</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2013

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Lecture Notes in Computer Science

ISBN

9783642382321

ISSN

0302-9743

e-ISSN

—

Number of pages

12

Pages from-to

13-24

Publisher name

Springer

Place of publication

Germany

Event location

Barcelona, Spain

Event date

Jan 1, 2013

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—