We discuss how to develop efficient heuristics for the distance based critical node problem, that is the problem of deleting a subset of nodes from a graph G in such a way that the distance between each pair of nodes is as large as possible.

A preliminary analysis of the Distance Based Critical Node Problem

ARINGHIERI, ROBERTO;GROSSO, Andrea Cesare;HOSTEINS, Pierre;
2016

Abstract

We discuss how to develop efficient heuristics for the distance based critical node problem, that is the problem of deleting a subset of nodes from a graph G in such a way that the distance between each pair of nodes is as large as possible.
14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16)
Gargnano, Italy
5 - 8 june 2016
55
C
25
28
http://www.sciencedirect.com/science/article/pii/S1571065316301639
Aringhieri, Roberto; Grosso, Andrea; Hosteins, Pierre; Scatamacchia, Rosario
File in questo prodotto:
File Dimensione Formato  
2016-DCNP-CTW-ENDM.pdf

Accesso riservato

Descrizione: PDF editoriale
Tipo di file: PDF EDITORIALE
Dimensione 156.27 kB
Formato Adobe PDF
156.27 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
2016-DCNP-CTW-ENDM-postPrint.pdf

Accesso aperto con embargo fino al 17/11/2018

Descrizione: Post Print
Tipo di file: POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione 381.09 kB
Formato Adobe PDF
381.09 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2318/1614169
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? ND
social impact