Thumbnail - Request a copy

Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs

Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Theis, Dirk Oliver (2019), Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs, Theoretical Computer Science, 775, p. 1-15. 10.1016/j.tcs.2018.11.025

Type
Article accepté pour publication ou publié
Date
2019
Journal name
Theoretical Computer Science
Volume
775
Publisher
Elsevier
Pages
1-15
Publication identifier
Metadata
Show full item record
Author(s)
Khoshkhah, Kaveh

Khosravian Ghadikolaei, Mehdi
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Monnot, Jérôme cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Theis, Dirk Oliver
Abstract (EN)
A solution extension problem consists in an instance and a partial feasible solution which is given in advance and the goal is to extend this partial solution to a feasible one. Many well-known problems like Coloring Extension Problems, Traveling Salesman Problem and Routing problems, have been studied in this framework. In this paper, we focus on the edge-weighted spanning star forest problem for both minimization and maximization versions. The goal here is to find a vertex partition of an edge-weighted graph into disjoint non-trivial stars and the value of a solution is given by the sum of the edge-weights of the stars. We propose NP-hardness, parameterized complexity, positive and negative approximation results.
Subjects / Keywords
Computational complexity; Parameterized complexity; Approximation algorithms; Graphs; Extended solution; Spanning Star Forest