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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 904; S. 48 - 65
Hauptverfasser:	Casel, Katrin, Fernau, Henning, Khosravian Ghadikolaei, Mehdi, Monnot, Jérôme, Sikora, Florian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.02.2022 Elsevier
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!