Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem

Roberto Maria Rosati; Salim Bouamama; Christian Blum

doi:10.1007/978-3-031-26504-4_22

Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem

Roberto Maria Rosati, Salim Bouamama, Christian Blum

Publikation: Beitrag in Buch/Konferenzband › Beitrag in Konferenzband

Originalsprache	Englisch
Titel des Sammelwerks	Metaheuristics
Untertitel des Sammelwerks	14th International Conference, MIC 2022, Syracuse, Italy, July 11–14, 2022, Proceedings
Herausgeber*innen	Luca Di Gaspero, Paola Festa, Amir Nakib, Mario Pavone
Erscheinungsort	Cham
Verlag	Springer
Seiten	306-321
ISBN (elektronisch)	978-3-031-26504-4
ISBN (Print)	978-3-031-26503-7
DOIs	https://doi.org/10.1007/978-3-031-26504-4_22
Publikationsstatus	Veröffentlicht - 2023
Extern publiziert	Ja

Publikationsreihe

Reihe	Lecture Notes in Computer Science (LNCS)
Nummer	13838
ISSN	0302-9743

Zugriff auf Dokument

10.1007/978-3-031-26504-4_22

Zitat

Rosati, R. M., Bouamama, S., & Blum, C. (2023). Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. in L. Di Gaspero, P. Festa, A. Nakib, & M. Pavone (Hrsg.), Metaheuristics: 14th International Conference, MIC 2022, Syracuse, Italy, July 11–14, 2022, Proceedings (S. 306-321). Springer. https://doi.org/10.1007/978-3-031-26504-4_22

Rosati, Roberto Maria ; Bouamama, Salim ; Blum, Christian. / Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. Metaheuristics: 14th International Conference, MIC 2022, Syracuse, Italy, July 11–14, 2022, Proceedings. Hrsg. / Luca Di Gaspero ; Paola Festa ; Amir Nakib ; Mario Pavone. Cham : Springer, 2023. S. 306-321 (Lecture Notes in Computer Science (LNCS); Nr. 13838).

@inproceedings{156f581770ec426ca4978100c842ab11,

title = "Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem",

author = "Rosati, \{Roberto Maria\} and Salim Bouamama and Christian Blum",

year = "2023",

doi = "10.1007/978-3-031-26504-4\_22",

language = "English",

isbn = "978-3-031-26503-7",

series = "Lecture Notes in Computer Science (LNCS)",

publisher = "Springer",

number = "13838",

pages = "306--321",

editor = "\{Di Gaspero\}, Luca and Paola Festa and Amir Nakib and Mario Pavone",

booktitle = "Metaheuristics",

address = "Germany",

}

Rosati, RM, Bouamama, S & Blum, C 2023, Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. in L Di Gaspero, P Festa, A Nakib & M Pavone (Hrsg.), Metaheuristics: 14th International Conference, MIC 2022, Syracuse, Italy, July 11–14, 2022, Proceedings. Springer, Cham, Lecture Notes in Computer Science (LNCS), Nr. 13838, S. 306-321. https://doi.org/10.1007/978-3-031-26504-4_22

Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. / Rosati, Roberto Maria; Bouamama, Salim; Blum, Christian.
Metaheuristics: 14th International Conference, MIC 2022, Syracuse, Italy, July 11–14, 2022, Proceedings. Hrsg. / Luca Di Gaspero; Paola Festa; Amir Nakib; Mario Pavone. Cham: Springer, 2023. S. 306-321 (Lecture Notes in Computer Science (LNCS); Nr. 13838).

Publikation: Beitrag in Buch/Konferenzband › Beitrag in Konferenzband

TY - GEN

T1 - Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem

AU - Rosati, Roberto Maria

AU - Bouamama, Salim

AU - Blum, Christian

PY - 2023

Y1 - 2023

U2 - 10.1007/978-3-031-26504-4_22

DO - 10.1007/978-3-031-26504-4_22

M3 - Contribution to conference proceedings

SN - 978-3-031-26503-7

T3 - Lecture Notes in Computer Science (LNCS)

SP - 306

EP - 321

BT - Metaheuristics

A2 - Di Gaspero, Luca

A2 - Festa, Paola

A2 - Nakib, Amir

A2 - Pavone, Mario

PB - Springer

CY - Cham

ER -

Rosati RM, Bouamama S, Blum C. Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem. in Di Gaspero L, Festa P, Nakib A, Pavone M, Hrsg., Metaheuristics: 14th International Conference, MIC 2022, Syracuse, Italy, July 11–14, 2022, Proceedings. Cham: Springer. 2023. S. 306-321. (Lecture Notes in Computer Science (LNCS); Nr. 13838). doi: 10.1007/978-3-031-26504-4_22