Autor:	Omar Viera, Rodrigo Recoba, Pablo Romero, Franco Robledo
Rok vydání:	2016
Předmět:	Combinatorics Computer science GRASP Graph (abstract data type) Undirected graph
Zdroj:	Hybrid Metaheuristics ISBN: 9783319396354
DOI:	10.1007/978-3-319-39636-1_8
Popis:	A generalization of the Ring Star Problem, called Two-Node-connected Star Problem (2NCSP), is here addressed. We are given an undirected graph, pendant-costs and core-costs. The goal is to find the minimum-cost spanning graph, where the core is a two-node-connected component, and the remaining nodes are pendant to this component.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::14c01a2ab841c5c22faac5ac67189740 https://doi.org/10.1007/978-3-319-39636-1_8 Zobrazit plný text záznamu