Graph Fragmentation Problem

Juan Piccini, Franco Robledo, Pablo Romero

2016

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.

References

  1. Amaldi, E., Capone, A., and Malucelli, F. (2003a). Planning UMTS base station location: Optimization models with power control and algorithms. IEEE Transactions on Wireless Communications, 2(5):939-952.
  2. Amaldi, E., Capone, A., Malucelli, F., and Signori, F. (2003b). Optimization models and algorithms for downlink UMTS radio planning. In Wireless Communications and Networking, (WCNC'03), volume 2, pages 827-831.
  3. Borgatti, S. (2006). Identifying sets of key players in a social network. Computational & Mathematical Organization Theory, 12:21-34.
  4. Canuto, S., Resende, M., and Ribeiro, C. (2001). Local search with perturbation for the prize-collecting Steiner tree problems in graphs. Networks, 38:50-58.
  5. Dorigo, M. (1992). Optimization, Learning and Natural Algorithms. PhD thesis, DEI Politecnico de Milano, Italia.
  6. Feo, T. A. and Resende, M. G. C. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8(2):67 - 71.
  7. Gendreau, M. and Potvin, J.-Y. (2010). Handbook of Metaheuristics. Springer Publishing Company, Incorporated, 2nd edition.
  8. Glover, F. (1989). Tabu search - part i. INFORMS Journal on Computing, 1(3):190-206.
  9. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1st edition.
  10. Hansen, P. and Mladenovic, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3):449-467.
  11. Kennedy, J. and Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the IEEE International Conference on Neural Networks, volume 4, pages 1942-1948. IEEE.
  12. Kirkpatrick, S. (1984). Optimization by simulated annealing: Quantitative studies. Journal of Statistical Physics, 34(5):975-986.
  13. Lin, S. and Kernighan, B. W. (1973). An Effective Heuristic Algorithm for the Traveling-Salesman Problem. Operations Research, 21(2):498-516.
  14. Monma, C. L., Munson, B. S., and Pulleyblank, W. R. (1990). Minimum-weight two-connected spanning networks. Mathematical Programming, 46(1-3):153- 171.
  15. Ortiz-Arroyo, D. (2010). Discovering sets of key players in social networks, in Computational Social Network Analysis, Chp. 2. Springer London.
  16. Papadimitriou, C. H. and Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. Prentice-Hall, Inc., Upper Saddle River, NJ, USA.
  17. Resende, M. G. C. and Ribeiro, C. C. (2003). Greedy Randomized Adaptive Search Procedures. In F. Glover and G. Kochenberger, editors, Handbook of Methaheuristics, Kluwer Academic Publishers.
  18. Resende, M. G. C. and Ribeiro, C. C. (2014). Grasp: Greedy randomized adaptive search procedures. In Burke, E. K. and Kendall, G., editors, Search Methodologies, pages 287-312. Springer US.
  19. Robledo Amoza, F. (2005). GRASP heuristics for Wide Area Network design. PhD thesis, INRIA/IRISA, Université de Rennes I, Rennes, France.
  20. Romero, P. (2012). Mathematical analysis of scheduling policies in Peer-to-Peer video streaming networks. PhD thesis, Facultad de Ingeniería, Universidad de la Rep ública, Montevideo, Uruguay.
  21. Srinivasan, A., Ramakrishnan, K., Kumaram, K., Aravamudam, M., and Naqvi, S. (2000). Optimal design of signaling networks for Internet telephony. In Proceedgins of the IEEE INFOCOM 2000.
  22. Stoer, M. (1993). Design of Survivable Networks. Lecture Notes in Mathematics. Springer.
Download


Paper Citation


in Harvard Style

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


in Bibtex Style

@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 - Volume 1: ICORES,},
year={2016},
pages={137-144},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005697701370144},
isbn={978-989-758-171-7},
}


in EndNote Style

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