On the complexity of solution extension of optimization problems

•Extending a partial solution of an optimization problem occurs as a subproblem in many areas.•We propose a general framework for dealing with these extension problems.•We present several problems from different areas which can be expressed in this framework.•We show NP-hardness results and paramete...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 904; s. 48 - 65
Hlavní autori:	Casel, Katrin, Fernau, Henning, Khosravian Ghadikolaei, Mehdi, Monnot, Jérôme, Sikora, Florian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.02.2022 Elsevier
Predmet:	Computational Complexity Computer Science Data Structures and Algorithms Discrete Mathematics Extension problems NP-hardness Parameterized complexity NP-hardness Parameterized complexity Extension problems
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!