Graph Fragmentation Problem

Juan Piccini; Franco Robledo; Pablo Romero

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Graph Fragmentation Problem

Topics: Mathematical Modeling; Optimization

In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems ICORES - Volume 1, 137-144, 2016 , Rome, Italy

Authors: Juan Piccini ; Franco Robledo and Pablo Romero

Affiliation: Facultad de Ingeniería and Universidad de la República, Uruguay

Keyword(s): Graph Theory, Combinatorial Optimization Problem, Metaheuristics, GRASP, Path Relinking.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Mathematical Modeling ; Methodologies and Technologies ; Operational Research ; Optimization ; Symbolic Systems

Abstract: A combinatorial optimization problem called Graph Fragmentation Problem (GFP) is introduced. The decision variable is a set of protected nodes, which are deleted from the graph. An attacker picks a non-protected node uniformly at random from the resulting subgraph, and it completely affects the corresponding connected component. The goal is to minimize the expected number of affected nodes S. The GFP finds applications in fire fighting, epidemiology and robust network design among others. A Greedy notion for the GFP is presented. Then, we develop a GRASP heuristic enriched with a Path-Relinking post-optimization phase. Both heuristics are compared on the lights of graphs inspired by a real-world application.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.12.41.106

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Piccini, J.; Robledo, F. and Romero, P. (2016). Graph Fragmentation Problem. In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - ICORES; ISBN 978-989-758-171-7; ISSN 2184-4372, SciTePress, pages 137-144. DOI: 10.5220/0005697701370144

@conference{icores16,
author={Juan Piccini. and Franco Robledo. and Pablo Romero.},
title={Graph Fragmentation Problem},
booktitle={Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - ICORES},
year={2016},
pages={137-144},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005697701370144},
isbn={978-989-758-171-7},
issn={2184-4372},
}

TY - CONF

JO - Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - ICORES
TI - Graph Fragmentation Problem
SN - 978-989-758-171-7
IS - 2184-4372
AU - Piccini, J.
AU - Robledo, F.
AU - Romero, P.
PY - 2016
SP - 137
EP - 144
DO - 10.5220/0005697701370144
PB - SciTePress