• 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 - No thumbnail

Parameterized Complexity and Approximation Issues for the Colorful Components Problems

Dondi, Riccardo; Sikora, Florian (2016), Parameterized Complexity and Approximation Issues for the Colorful Components Problems, in Beckmann, Arnold; Bienvenu, Laurent; Jonoska, Nataša, Pursuit of the Universal. 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings, Springer International Publishing : Berlin, p. 261-270. 10.1007/978-3-319-40189-8_27

Type
Communication / Conférence
External document link
https://arxiv.org/abs/1605.03071v1
Date
2016
Conference title
12th Conference on Computability in Europe, CiE 2016
Conference date
2016-06
Conference city
Paris
Conference country
France
Book title
Pursuit of the Universal. 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings
Book author
Beckmann, Arnold; Bienvenu, Laurent; Jonoska, Nataša
Publisher
Springer International Publishing
Published in
Berlin
ISBN
978-3-319-40188-1
Pages
261-270
Publication identifier
10.1007/978-3-319-40189-8_27
Metadata
Show full item record
Author(s)
Dondi, Riccardo

Sikora, Florian cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last ten years. Here we consider two variants, Minimum Colorful Components (MCC) and Maximum Edges in transitive Closure (MEC), introduced in the context of orthology gene identification in bioinformatics. The input of both MCC and MEC is a vertex-colored graph. MCC asks for the removal of a subset of edges, so that the resulting graph is partitioned in the minimum number of colorful connected components; MEC asks for the removal of a subset of edges, so that the resulting graph is partitioned in colorful connected components and the number of edges in the transitive closure of such a graph is maximized. We study the parameterized and approximation complexity of MCC and MEC, for general and restricted instances.
Subjects / Keywords
Parameterized Complexity; Approximation

Related items

Showing items related by title and author.

  • Thumbnail
    Parameterized complexity and approximation issues for the colorful components problems 
    Dondi, Riccardo; Sikora, Florian (2018) Article accepté pour publication ou publié
  • Thumbnail
    The Longest Run Subsequence Problem: Further Complexity Results 
    Sikora, Florian; Dondi, Riccardo (2021) Communication / Conférence
  • Thumbnail
    Covering with Clubs: Complexity and Approximability 
    Dondi, Riccardo; Mauri, Giancarlo; Sikora, Florian; Zoppis, Italo (2018) Communication / Conférence
  • Thumbnail
    Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems 
    Bonnet, Édouard; Paschos, Vangelis; Sikora, Florian (2016) Article accepté pour publication ou publié
  • Thumbnail
    Parameterized and approximation complexity of Partial VC Dimension 
    Bazgan, Cristina; Foucaud, Florent; Sikora, Florian (2019) 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