Gumbel-softmax-based optimization: a simple general framework for optimization problems on graphs

Computational Social Networks

Table 7 Time consumption on influence maximization problems

Graph	Size	Algorithm	Number of initial nodes
Graph	Size	Algorithm	1	2	3	4	5
Government	7057	Greedy	155.3 s	315.7 s	470.3 s	618.2 s	776.8 s
		SA	3387.1 s	3432.5 s	3352.6 s	3468.2 s	3341.2 s
		GSO^a	38.6 s	40.8 s	38.4 s	41.6 s	41.0 s

The best results are denoted in italic
^aConfiguration: batch size = 128, fixed \(\tau\) = 1, learning rate = 1, \(\alpha\) = 5, instance = 10, and epoch = 2000