Parameterized Shifted Combinatorial Optimization

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00095083" target="_blank" >RIV/00216224:14330/17:00095083 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1007/978-3-319-62389-4_19" target="_blank" >http://dx.doi.org/10.1007/978-3-319-62389-4_19</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-62389-4_19" target="_blank" >10.1007/978-3-319-62389-4_19</a>

Result language

angličtina

Original language name

Parameterized Shifted Combinatorial Optimization

Original language description

Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. This framework captures well studied and diverse problems ranging from so-called vulnerability problems to sharing and partitioning problems. In particular, every standard combinatorial optimization problem has its shifted counterpart, which is typically much harder. Already with explicitly given input set the shifted problem may be NP-hard. In this article we initiate a study of the parameterized complexity of this framework. First we show that shifting over an explicitly given set with its cardinality as the parameter may be in XP, FPT or P, depending on the objective function. Second, we study the shifted problem over sets definable in MSO logic (which includes, e.g., the well known MSO partitioning problems). Our main results here are that shifted combinatorial optimization over MSO definable sets is in XP with respect to the MSO formula and the treewidth (or more generally clique-width) of the input graph, and is W[1]-hard even under further severe restrictions.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2017

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

International Computing and Combinatorics Conference COCOON 2017 (LNCS, volume 10392)

ISBN

9783319623887

ISSN

—

e-ISSN

—

Number of pages

13

Pages from-to

224-236

Publisher name

Springer International Publishing AG

Place of publication

Hong Kong

Event location

Hong Kong

Event date

Aug 3, 2017

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000771461800019