An iterated greedy algorithm for the node placement problem in bidirectional Manhattan street networks.
Fubito ToyamaKenji ShojiJuichi MiyamichiPublished in: GECCO (2008)
Keyphrases
- greedy algorithm
- iterated greedy
- greedy algorithms
- objective function
- greedy strategy
- worst case
- set cover
- network analysis
- influence maximization
- dynamic programming
- submodular functions
- influential nodes
- directed graph
- complex networks
- lower bound
- permutation flowshop
- search algorithm
- influence spread
- optimal solution