Academic Journal
Extension of some edge graph problems: Standard, parameterized and approximation complexity
| Τίτλος: | Extension of some edge graph problems: Standard, parameterized and approximation complexity |
|---|---|
| Συγγραφείς: | Casel, Katrin, Fernau, Henning, Khosravian Ghadikolaei, Mehdi, Monnot, Jérôme, Sikora, Florian |
| Συνεισφορές: | Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), ANR-17-CE23-0010,ESIGMA,Efficacité et structure pour les applications de la fouille de graphes(2017), ANR-21-CE48-0022,S-EX-AP-PE-AL,Algorithmes d'Approximation Sous-Exponentiels et Paramétrés(2021) |
| Πηγή: | ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal.science/hal-04218296 ; Discrete Applied Mathematics, 2023, 340, pp.183-201. ⟨10.1016/j.dam.2023.06.042⟩. |
| Στοιχεία εκδότη: | HAL CCSD Elsevier |
| Έτος έκδοσης: | 2023 |
| Συλλογή: | Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe) |
| Θεματικοί όροι: | Extension problems Edge Cover Matching Edge Domination NP-completeness Parameterized Complexity Approximation 2020 MSC: 68Q17 68Q25 68Q27, Extension problems, Edge Cover, Matching, Edge Domination, NP-completeness, Parameterized Complexity, Approximation 2020 MSC: 68Q17, 68Q25, 68Q27, [INFO]Computer Science [cs] |
| Περιγραφή: | International audience ; We consider extension variants of some edge optimization problems in graphs containing the classical Edge Cover, Matching, and Edge Dominating Set problems and generalizations thereof. Given a graph G = (V, E) and an edge set U ⊆ E, it is asked whether there exists an inclusion-wise minimal (or maximal, respectively) feasible solution E which satisfies a given property, for instance, being an edge dominating set (or a matching, respectively) and containing the forced edge set U (or avoiding any edges from the forbidden edge set E \ U , respectively). We present hardness results for these problems, for restricted instances such as bipartite or planar graphs. We counterbalance these negative results with parameterized complexity results. We also consider the price of extension, a natural optimization problem variant of extension problems, leading to some approximation and inapproximability results. |
| Τύπος εγγράφου: | article in journal/newspaper |
| Γλώσσα: | English |
| Relation: | hal-04218296; https://hal.science/hal-04218296; https://hal.science/hal-04218296/document; https://hal.science/hal-04218296/file/Extension_of_some_edge_graph_problems.pdf |
| DOI: | 10.1016/j.dam.2023.06.042 |
| Διαθεσιμότητα: | https://hal.science/hal-04218296 https://hal.science/hal-04218296/document https://hal.science/hal-04218296/file/Extension_of_some_edge_graph_problems.pdf https://doi.org/10.1016/j.dam.2023.06.042 |
| Rights: | info:eu-repo/semantics/OpenAccess |
| Αριθμός Καταχώρησης: | edsbas.7B84BC21 |
| Βάση Δεδομένων: | BASE |
| DOI: | 10.1016/j.dam.2023.06.042 |
|---|