Fetching the paper…
Reading the bibliography…
Steiner Tree Problem (STP) in graphs aims to find a tree of minimum weight in the graph that connects a given set of vertices.
Exploratory combinatorial optimization with reinforcement learning
Barrett, T. D.; Clements, W. R.; Foerster, J. N.; and Lvovsky, A. I. 2019 · 1909
Earlier work this paper cites.
On the evolution of random graphs
Erdős, P.; and Rényi, A. 1960 · 1960
Earlier work this paper cites.
The Steiner problem in graphs
Dreyfus, S. E.; and Wagner, R. A. 1971 · 1971
Earlier work this paper cites.
Reducibility among combinatorial problems
Karp, R. M. 1972 · 1972
Earlier work this paper cites.
A fast algorithm for Steiner trees
Kou, L.; Markowsky, G.; and Berman, L. 1981 · 1981
Earlier work this paper cites.
Computers and intractability: a guide to the theory of NP-completeness (michael r. garey and david s. johnson)
Hartmanis, J. 1982 · 1982
Earlier work this paper cites.
NETWORK DESIGN PROBLEMS: STEINER TREES AND SPANNING K-TREES
Bern, M. W. 1988 · 1988
Earlier work this paper cites.
Solving the Steiner Tree Problem on a Graph Using Branch and Cut
Chopra, S.; Gorres, E. R.; and Rao, M. R. 1992 · 1992
Earlier work this paper cites.
Using neural networks to solve Steiner Tree Problem
Jin, Z.; Shu, H.; and Ming, G. H. 1993 · 1993
Earlier work this paper cites.
Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm
Esbensen, H. 1995 · 1995
Earlier work this paper cites.
A critical point for random graphs with a given degree sequence
Molloy, M.; and Reed, B. 1995 · 1995
Earlier work this paper cites.
Neural Network for Optimal Steiner Tree Computation
Pornavalai, C.; Shiratori, N.; and Chakraborty, G. 1996 · 1996
Earlier work this paper cites.
The Steiner tree packing problem in VLSI design
Grötschel, M.; Martin, A.; and Weismantel, R. 1997 · 1997
Earlier work this paper cites.
Solving Steiner tree problems in graphs to optimality
Koch, T.; and Martin, A. 1998 · 1998
Earlier work this paper cites.
Collective dynamics of ‘small-world’networks
Watts, D. J.; and Strogatz, S. H. 1998 · 1998
Earlier work this paper cites.
SATLIB: An online resource for research on SAT
Hoos, H. H.; and Stützle, T. 2000 · 2000
Earlier work this paper cites.
SteinLib: An updated library on Steiner tree problems in graphs
Koch, T.; Martin, A.; and Voß, S. 2001 · 2001
Earlier work this paper cites.
Fast Detection of Maximum Common Subgraph via Deep Q-Learning
Bai, Y.; Xu, D.; Wang, A.; Gu, K.; Wu, X.; Marinovic, A.; Ro, C.; Sun, Y.; and Wang, W. 2020 · 2002
Cited alongside, same era.
Design of multimodal transport networks: A hierarchical approach
Van Nes, R. 2002 · 2002
Cited alongside, same era.
Steiner tree NP-completeness proof
Santuari, A. 2003 · 2003
Cited alongside, same era.
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization
Cappart, Q.; Moisan, T.; Rousseau, L.-M.; Prémont-Schwarz, I.; and Cire, A. 2020 · 2006
Cited alongside, same era.
An Ant Algorithm for the Steiner Tree Problem in Graphs
Luyet, L.; Varone, S.; and Zufferey, N. 2007 · 2007
Cited alongside, same era.
Predict anchor links across social networks via an embedding approach
Man, T.; Shen, H.; Liu, S.; Jin, X.; and Cheng, X. 2016 · 2016
Later among the works it cites.
Representation learning on graphs: Methods and applications
Hamilton, W. L.; Ying, R.; and Leskovec, J. 2017 · 2017
Later among the works it cites.
Learning combinatorial optimization algorithms over graphs
Khalil, E.; Dai, H.; Zhang, Y.; Dilkina, B.; and Song, L. 2017 · 2017
Later among the works it cites.
Learning entity and relation embeddings for knowledge resolution
Lin, H.; Liu, Y.; Wang, W.; Yue, Y.; and Lin, Z. 2017 · 2017
Later among the works it cites.
struc2vec: Learning node representations from structural identity
Ribeiro, L. F.; Saverese, P. H.; and Figueiredo, D. R. 2017 · 2017
Later among the works it cites.
Mastering the game of go without human knowledge
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Peng, Y.; Choi, B.; and Xu, J. 2020 · 2008
Cited alongside, same era.
Star: Steiner-tree approximation in relationship graphs
Kasneci, G.; Ramanath, M.; Sozio, M.; Suchanek, F. M.; and Weikum, G. 2009 · 2009
Cited alongside, same era.
The Steiner tree problem: a tour through graphs, algorithms, and complexity
Prömel, H. J.; and Steger, A. 2012 · 2012
Cited alongside, same era.
Knowledge graph embedding by translating on hyperplanes
Wang, Z.; Zhang, J.; Feng, J.; and Chen, Z. 2014 · 2014
Cited alongside, same era.
Human-level control through deep reinforcement learning
Mnih, V.; Kavukcuoglu, K.; Silver, D.; Rusu, A. A.; Veness, J.; Bellemare, M. G.; Graves, A.; Riedmiller, M.; Fidjeland, A. K.; Ostrovski, G.; et al. 2015 · 2015
Cited alongside, same era.
Deep reinforcement learning with double q-learning
Van Hasselt, H.; Guez, A.; and Silver, D. 2015 · 2015
Cited alongside, same era.
Neural combinatorial optimization with reinforcement learning
Bello, I.; Pham, H.; Le, Q. V.; Norouzi, M.; and Bengio, S. 2016 · 2016
Cited alongside, same era.
Silver, D.; Schrittwieser, J.; Simonyan, K.; Antonoglou, I.; Huang, A.; Guez, A.; Hubert, T.; Baker, L.; Lai, M.; Bolton, A.; et al. 2017 · 2017
Later among the works it cites.
Scalable graph embedding for asymmetric proximity
Zhou, C.; Liu, Y.; Liu, X.; Liu, Z.; and Gao, J. 2017 · 2017
Later among the works it cites.
Combinatorial optimization with graph convolutional networks and guided tree search
Li, Z.; Chen, Q.; and Koltun, V. 2018 · 2018
Later among the works it cites.
Reinforcement learning: An introduction
Sutton, R. S.; and Barto, A. G. 2018 · 2018
Later among the works it cites.
Graph Attention Networks
Velickovic, P.; Cucurull, G.; Casanova, A.; Romero, A.; Lio, P.; and Bengio, Y. 2018 · 2018
Later among the works it cites.
Graph convolutional neural networks for web-scale recommender systems
Ying, R.; He, R.; Chen, K.; Eksombatchai, P.; Hamilton, W. L.; and Leskovec, J. 2018 · 2018
Later among the works it cites.
Improving optimization bounds using machine learning: Decision diagrams meet deep reinforcement learning
Cappart, Q.; Goutierre, E.; Bergman, D.; and Rousseau, L.-M. 2019 · 2019
Later among the works it cites.
Separator-Based Pruned Dynamic Programming for Steiner Tree
Iwata, Y.; and Shigemura, T. 2019 · 2019
Later among the works it cites.
Learning Heuristics over Large Graphs via Deep Reinforcement Learning
Mittal, A.; Dhawan, A.; Medya, S.; Ranu, S.; and Singh, A. K. 2019 · 2019
Later among the works it cites.
Co-training for policy learning
Song, J.; Lanka, R.; Yue, Y.; and Ono, M. 2020 · 2020
Later among the works it cites.
Neural Execution of Graph Algorithms
Velikovi, P.; Ying, R.; Padovano, M.; Hadsell, R.; and Blundell, C. 2020 · 2020
Later among the works it cites.