Complexity and inapproximability results for balanced connected subgraph problem

Timothée Martinod; Valentin Pollet; Benoit Darties; Rodolphe Giroudeau; Jean-Claude König

doi:10.1016/j.tcs.2021.07.010

Journal articles

Complexity and inapproximability results for balanced connected subgraph problem

Timothée Martinod ¹ Valentin Pollet ¹ Benoit Darties ¹ Rodolphe Giroudeau ¹ Jean-Claude König ¹

1 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux

LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier

Keywords : Complexity Approximation Color-balanced subgraph

Document type :

Journal articles

Domain :

Mathematics [math] / Combinatorics [math.CO]

Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-03475313
Contributor : Isabelle Gouat Connect in order to contact the contributor
Submitted on : Friday, December 10, 2021 - 5:40:13 PM
Last modification on : Tuesday, January 4, 2022 - 6:06:53 AM

Complexity and inapproximability results for balanced connected subgraph problem

Identifiers

Collections

Citation

Export

Metrics

6

Complexity and inapproximability results for balanced connected subgraph problem

Identifiers

Collections

Citation

Export

Share

Metrics

6