• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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
10.1016/j.tcs.2018.11.025
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

Related items

Showing items related by title and author.

  • Thumbnail
    Extension of Some Edge Graph Problems: Standard and Parameterized Complexity 
    Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Sikora, Florian (2019) Communication / Conférence
  • Thumbnail
    Weighted Upper Edge Cover: Complexity and Approximability 
    Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Sikora, Florian (2019) Communication / Conférence
  • Thumbnail
    Weighted Upper Edge Cover: Complexity and Approximability 
    Khoshkhah, Kaveh; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Sikora, Florian (2020) Article accepté pour publication ou publié
  • Thumbnail
    Extension of Vertex Cover and Independent Set in Some Classes of Graphs 
    Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme; Sikora, Florian (2019) Communication / Conférence
  • Thumbnail
    On the complexity of solution extension of optimization problems 
    Sikora, Florian; Casel, Katrin; Fernau, Henning; Khosravian Ghadikolaei, Mehdi; Monnot, Jérôme (2020) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo