Search results for "path-tree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
52	Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu	From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns.	ICDM	2002	DBLP DOI BibTeX RDF
42	Sanghyun Ahn, David Hung-Chang Du	A Multicast Tree Algorithm Considering Maximum Delay Bound for Real-Time Applications.	LCN	1996	DBLP DOI BibTeX RDF	multicast tree algorithm, maximum delay bound, multiple multicast tree concept, tree maintenance cost, DBMT problem, shortest path tree-based DBMT, minimal Steiner tree-based DBMT, MST DBMT, SPT DBMT, performance analysis, group communication, NP-hardness, heuristic algorithms, real-time applications, multicast routing, telecommunication traffic, real-time traffic
39	Sandeep K. S. Gupta, Pradip K. Srimani	Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks.	IEEE Trans. Parallel Distributed Syst.	2003	DBLP DOI BibTeX RDF	mobile multihop network, core selection, core migration, random graph generation, Mobile ad hoc network, online algorithm, multicast routing, adaptive protocol
29	Dongming Zhou, Rencan Nie, Dongfeng Zhao	A New Algorithm for Finding the Shortest Path Tree Using Competitive Pulse Coupled Neural Network.	ICIC (2)	2008	DBLP DOI BibTeX RDF	Competitive PCNN, shortest path tree, Dijkstra algorithm
29	Jie Wu 0001, Fei Dai 0001, Xiaola Lin, Jiannong Cao 0001, Weijia Jia 0001	An Extended Fault-Tolerant Link-State Routing Protocol in the Internet.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Fault tolerance, Internet, routing, loop-free, link-state
28	Kanchana Silawarawet, Natawut Nupairoj	Minimizing Multicast Communication Latency in WAN-Based Environment.	SNPD	2006	DBLP DOI BibTeX RDF
28	Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang	Efficiently answering reachability queries on very large directed graphs.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	maximal directed spanning tree, path-tree cover, transitive closure, graph indexing, reachability queries
28	W. Melody Moh, Marie Dumont, Teng-Sheng Moh, Takeo Hamada, Ching-Fong Su	Brief announcement: evaluation of tree-based data gathering algorithms for wireless sensor networks.	PODC	2005	DBLP DOI BibTeX RDF	maximum-leaf tree algorithm, shortest-path tree algorithm, routing, energy efficiency
26	Peng-Jun Wan, Gruia Calinescu, Chih-Wei Yi	Minimum-power multicast routing in static ad hoc wireless networks.	IEEE/ACM Trans. Netw.	2004	DBLP DOI BibTeX RDF	approximation algorithms, power control, multicast routing
25	Paula Tarrío, Giuseppe Valenzise, Godwin Shen, Antonio Ortega	Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks.	GSN	2009	DBLP DOI BibTeX RDF	In-network compression, wavelet lifting, distributed routing algorithms, collection tree protocol, shortest path tree
25	Bing-Hong Liu, Wei-Chieh Ke, Ming-Jer Tsai	Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks.	Telecommun. Syst.	2006	DBLP DOI BibTeX RDF	Minimum non-leaf multicast tree, Bandwidth consumption, Mobile ad hoc network, Distributed algorithm, Multicast routing
25	Liang Guo 0016, Ibrahim Matta	QDMR: An Efficient QoS Dependent Multicast Routing Algorithm.	IEEE Real Time Technology and Applications Symposium	1999	DBLP DOI BibTeX RDF	real-time multicast routing, constrained path optimization, simulation, Quality-of-Service networks
24	Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C. E. Veni Madhavan	Computing the Shortest Path Tree in a Weak Visibility Polygon.	FSTTCS	1991	DBLP DOI BibTeX RDF
23	Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi	Approximation Algorithms for a Network Design Problem.	COCOON	2009	DBLP DOI BibTeX RDF
23	Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry	3-HOP: a high-compression indexing scheme for reachability query.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	2-hop, 3-hop, path-tree, transitive closure, graph indexing, reachability queries
23	Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko	Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks.	AINA	2005	DBLP DOI BibTeX RDF
22	Hiroshi Fujinoki, Kenneth J. Christensen	The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees.	LCN	1999	DBLP DOI BibTeX RDF
21	Chin-Chen Chang 0001, Fun-Chou Shiue, Tung-Shou Chen	Tree Structured Vector Quantization with Dynamic Path Search.	ICPP Workshops	1999	DBLP DOI BibTeX RDF	TSVQ, multi-path TSVQ and image compression, VQ
21	Zhipeng Tan, Dan Feng 0001, Fei He, Ke Zhou 0001	Studying of Multi-dimensional Based Replica Management in Object Storage System.	EUC Workshops	2007	DBLP DOI BibTeX RDF	Multi-dimensional Architecture, Optimal tree, One-path tree, Searching, Replica management
21	Randeep Bhatia, Li (Erran) Li	Characterizing achievable multicast rates in multi-hop wireless networks.	MobiHoc	2005	DBLP DOI BibTeX RDF	optimization, graph theory, mathematical programming, combinatorics
19	Danny Z. Chen, Ewa Misiolek	Finding Many Optimal Paths Without Growing Any Optimal Path Trees.	COCOON	2007	DBLP DOI BibTeX RDF
19	Kwang-il Hwang, Taeyoung Kim 0001, Doo Seop Eom	Proactive Data Delivery Scheme with Optimal Path for Dynamic Sensor Networks.	UIC	2007	DBLP DOI BibTeX RDF
19	Xiaotong Zhang, Lei Zhang, Jian Zhou	A High Performance Strategy for Constructing Dynamic MIB.	ITNG	2008	DBLP DOI BibTeX RDF	SNMP, HDTV, AVL tree, MIB
19	Razvan Cristescu, Baltasar Beferull-Lozano	Lossy network correlated data gathering with high-resolution coding.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	high-resolution rate-distortion, sensor networks, energy efficiency, shortest path tree
18	Frederic Dorn, Jan Arne Telle	Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.	LATIN	2006	DBLP DOI BibTeX RDF
17	Jakob Krarup, Malene Nordlund Rørbech	LP formulations of the shortest path tree problem.	4OR	2004	DBLP DOI BibTeX RDF	visualizing LP-duality, linear programming, Shortest paths
17	Bin Xiao 0001, Jiannong Cao 0001, Qingfeng Zhuge, Zili Shao, Edwin Hsing-Mean Sha	Dynamic Update of Shortest Path Tree in OSPF.	ISPAN	2004	DBLP DOI BibTeX RDF
17	Joffroy Beauquier, Thomas Hérault	Fault-Local Stabilization: The Shortest Path Tree.	SRDS	2002	DBLP DOI BibTeX RDF
17	Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu 0001, Jinhui Xu 0001	Finding an Optimal Path without Growing the Tree.	ESA	1998	DBLP DOI BibTeX RDF
16	Fen Zhou 0001, Miklós Molnár, Bernard Cousin	Avoidance of multicast incapable branching nodes for multicast routing in WDM networks.	LCN	2008	DBLP DOI BibTeX RDF
15	Han Xue, Tian Chai	Path Optimization along Buoys Based on the Shortest Path Tree with Uncertain Atmospheric and Oceanographic Data.	Comput. Intell. Neurosci.	2021	DBLP DOI BibTeX RDF
15	Zhong Shen, Yilin Chang, Xin Zhang, Can Cui	An Efficient Topology Maintenance Algorithm Based on Shortest Path Tree for Wireless Sensor Networks.	PDCAT	2005	DBLP DOI BibTeX RDF
14	Esteban Feuerstein, Alberto Marchetti-Spaccamela	Dynamic Algorithms for Shortest Paths in Planar Graphs.	WG	1991	DBLP DOI BibTeX RDF
14	Adele A. Rescigno	Optimally Balanced Spanning Tree of the Star Network.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	spanning trees, star network, All-to-all personalized communication
14	Peng Xiao, Yinfeng Xu, Bing Su	Finding an anti-risk path between two nodes in undirected graphs.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Most vital real time edge, Anti-risk path, Shortest path, Shortest path tree
14	Bin Xiao 0001, Jiannong Cao 0001, Qin Lu 0001	Dynamic SPT update for multiple link state decrements in network routing.	J. Supercomput.	2008	DBLP DOI BibTeX RDF	Multiple link state decrements, Network routing, Dynamic update, Shortest path tree
14	Huiyu Luo, Gregory J. Pottie	Designing routes for source coding with explicit side information in sensor networks.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	maximum weight branching, NP-hardness, source coding, Steiner tree, shortest path tree, data-centric routing
14	Yue Wang, Jie Gao 0001, Joseph S. B. Mitchell	Boundary recognition in sensor networks by topological methods.	MobiCom	2006	DBLP DOI BibTeX RDF	sensor networks, boundary detection, shortest path tree
14	Cees Duin	A Branch-Checking Algorithm for All-Pairs Shortest Paths.	Algorithmica	2005	DBLP DOI BibTeX RDF	Dynamic programming, Shortest path, Shortest path tree
14	Deying Li 0001, Xiaohua Jia, Hai Liu 0001	Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks.	IEEE Trans. Mob. Comput.	2004	DBLP DOI BibTeX RDF
12	Shuai Gao, Hongke Zhang, Sajal K. Das 0001	Efficient data collection in wireless sensor networks with path-constrained mobile sinks.	WOWMOM	2009	DBLP DOI BibTeX RDF
12	Yinfeng Xu, Huahai Yan	Real Time Critical Edge of the Shortest Path in Transportation Networks.	TAMC	2006	DBLP DOI BibTeX RDF	Real Time Critical Edge, The Shortest Path, Algorithm, Transportation Networks
12	Sudip Misra, B. John Oommen	Dynamic algorithms for the shortest path routing problem: learning automata-based solutions.	IEEE Trans. Syst. Man Cybern. Part B	2005	DBLP DOI BibTeX RDF
12	Giorgio Valentini	True Path Rule Hierarchical Ensembles.	MCS	2009	DBLP DOI BibTeX RDF
12	Dean H. Lorenz, Ariel Orda, Danny Raz, Yuval Shavitt	Efficient QoS partition and routing of unicast and multicast.	IEEE/ACM Trans. Netw.	2006	DBLP DOI BibTeX RDF	QoS-dependent costs, QoS, routing, multicast, resource allocation, approximation
12	Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio	Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs.	STACS	1997	DBLP DOI BibTeX RDF
12	Aaron Striegel, G. Manimaran	A Scalable Protocol for Member Join/Leave in DiffServ Multicast.	LCN	2001	DBLP DOI BibTeX RDF
10	Jisang Park, Sukmin Kang, Van Vi Vo, Hyunseung Choo	Efficient Shortest-Path Tree Construction Based on Graph Convolutional Networks.	IMCOM	2024	DBLP DOI BibTeX RDF
10	Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina	Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem.	Expert Syst. Appl.	2023	DBLP DOI BibTeX RDF
10	Zhenyu Tian, Jiali You 0001, Linlin Hu	A Reverse Shortest Path Tree-Based Multicast Joining Node Selection Method.	Future Internet	2023	DBLP DOI BibTeX RDF
10	Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore	The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm.	Networks	2023	DBLP DOI BibTeX RDF
10	Olivier De Jonckère, Juan A. Fraire, Scott Burleigh	Enhanced Pathfinding and Scalability with Shortest-Path Tree Routing for Space Networks.	ICC	2023	DBLP DOI BibTeX RDF
10	Huynh Thi Thanh Binh, Pham Dinh Thanh	Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem.	Evol. Intell.	2022	DBLP DOI BibTeX RDF
10	Camille Phiquepal, Andreas Orthey, Nicolas Viennot, Marc Toussaint	Path-Tree Optimization in Discrete Partially Observable Environments Using Rapidly-Exploring Belief-Space Graphs.	IEEE Robotics Autom. Lett.	2022	DBLP DOI BibTeX RDF
10	Camille Phiquepal, Andreas Orthey, Nicolas Viennot, Marc Toussaint	Path-Tree Optimization in Partially Observable Environments using Rapidly-Exploring Belief-Space Graphs.	CoRR	2022	DBLP DOI BibTeX RDF
10	Adrian Petrovan, Petrica C. Pop, Cosmin Sabo, Ioana Zelina	A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prüfer Code.	HAIS	2022	DBLP DOI BibTeX RDF
10	Phan Thi Hong Hanh, Pham Dinh Thanh, Huynh Thi Thanh Binh	Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem.	Inf. Sci.	2021	DBLP DOI BibTeX RDF
10	Ovidiu Cosma, Petrica C. Pop, Ioana Zelina	An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem.	IEEE Access	2021	DBLP DOI BibTeX RDF
10	Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai, Pham Dinh Thanh	A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization.	CoRR	2021	DBLP BibTeX RDF
10	Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai, Pham Dinh Thanh	A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization.	Eng. Appl. Artif. Intell.	2021	DBLP DOI BibTeX RDF
10	Songtao Ye, Junjie Wang, Hongjie Fan	Minimize Social Network Rumors Based on Rumor Path Tree.	IEEE Access	2020	DBLP DOI BibTeX RDF
10	Wei Yu 0011, Zhaohui Liu 0001, Xiaoguang Bao	New LP relaxations for Minimum Cycle/Path/Tree Cover Problems.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
10	Phan Thi Hong Hanh, Pham Dinh Thanh, Huynh Thi Thanh Binh	Evolutionary Algorithm and Multifactorial Evolutionary Algorithm on Clustered Shortest-Path Tree problem.	CoRR	2020	DBLP BibTeX RDF
10	Pham Dinh Thanh, Huynh Thi Thanh Binh, Do Dinh Dac, Nguyen Binh Long, Le Minh Hai Phong	A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem.	CoRR	2020	DBLP BibTeX RDF
10	Shuli Zou, Taorong Qiu, Peifan Huang, Haowen Luo, Xiaoming Bai	The functional brain network based on the combination of shortest path tree and its application in fatigue driving state recognition and analysis of the neural mechanism of fatigue driving.	Biomed. Signal Process. Control.	2020	DBLP DOI BibTeX RDF
10	Pham Dinh Thanh, Huynh Thi Thanh Binh, Tran Ba Trung	An efficient strategy for using multifactorial optimization to solve the clustered shortest path tree problem.	Appl. Intell.	2020	DBLP DOI BibTeX RDF
10	Paola Festa, Francesca Guerriero, Antonio Napoletano	An auction-based approach for the re-optimization shortest path tree problem.	Comput. Optim. Appl.	2019	DBLP DOI BibTeX RDF
10	Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen	Disconnected components detection and rooted shortest-path tree maintenance in networks.	J. Parallel Distributed Comput.	2019	DBLP DOI BibTeX RDF
10	Sanjiang Li, Yongming Li 0001	Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights.	CoRR	2019	DBLP BibTeX RDF
10	Huynh Thi Thanh Binh, Pham Dinh Thanh, Ta Bao Thang	New Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm.	CoRR	2019	DBLP BibTeX RDF
10	Huynh Thi Thanh Binh, Pham Dinh Thanh, Ta Bao Thang	New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm.	Knowl. Based Syst.	2019	DBLP DOI BibTeX RDF
10	Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti	Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem.	J. Comb. Optim.	2019	DBLP DOI BibTeX RDF
10	Pham Dinh Thanh, Huynh Thi Thanh Binh, Do Dinh Dac, Nguyen Binh Long, Le Minh Hai Phong	A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem.	CEC	2019	DBLP DOI BibTeX RDF
10	Iago A. Carvalho, Thiago F. Noronha, Christophe Duhamel, Luiz Filipe M. Vieira	A MILP-based VND for the min-max regret Shortest Path Tree Problem with interval costs.	Electron. Notes Discret. Math.	2018	DBLP DOI BibTeX RDF
10	Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti	Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem.	CoRR	2018	DBLP BibTeX RDF
10	Pardis Kavand, Ali Mohades	A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon.	Int. J. Found. Comput. Sci.	2018	DBLP DOI BibTeX RDF
10	Huynh Thi Thanh Binh, Pham Dinh Thanh, Tran Ba Trung, Le Phuong Thao	Effective Multifactorial Evolutionary Algorithm for Solving the Cluster Shortest Path Tree Problem.	CEC	2018	DBLP DOI BibTeX RDF
10	Pham Dinh Thanh, Dinh Anh Dung, Tran Ngoc Tien, Huynh Thi Thanh Binh	An Effective Representation Scheme in Multifactorial Evolutionary Algorithm for Solving Cluster Shortest-Path Tree Problem.	CEC	2018	DBLP DOI BibTeX RDF
10	Sara Riazi, Sriram Srinivasan 0001, Sajal K. Das 0001, Sanjukta Bhowmick, Boyana Norris	Single-Source Shortest Path Tree for Big Dynamic Graphs.	IEEE BigData	2018	DBLP DOI BibTeX RDF
10	Wei Yu 0011, Zhaohui Liu 0001, Xiaoguang Bao	New LP Relaxations for Minimum Cycle/Path/Tree Cover Problems.	AAIM	2018	DBLP DOI BibTeX RDF
10		Shortest Path Tree.	Encyclopedia of GIS	2017	DBLP DOI BibTeX RDF
10	Xiaoge Zhang 0001, Felix T. S. Chan, Hai Yang, Yong Deng 0001	An adaptive amoeba algorithm for shortest path tree computation in dynamic graphs.	Inf. Sci.	2017	DBLP DOI BibTeX RDF
10	Stéphane Devismes, David Ilcinkas, Colette Johnen	Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.	Discret. Math. Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
10	Shlomi Maliah, Rami Puzis, Guy Shani	Shortest path tree sampling for landmark selection in large networks.	J. Complex Networks	2017	DBLP DOI BibTeX RDF
10	Stéphane Devismes, David Ilcinkas, Colette Johnen	Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.	CoRR	2017	DBLP BibTeX RDF
10	Yan-Shan Tian, Qingguo Zhou, Fangqin Zhang, Jinjuan Li	Multi-hop clustering routing algorithm based on fuzzy inference and multi-path tree.	Int. J. Distributed Sens. Networks	2017	DBLP DOI BibTeX RDF
10	Haiyan Wang, Weiqi Deng, Binchao Huang, Jianping Li 0007	The restricted minimum single source shortest path tree expansion problem.	ICIS	2017	DBLP DOI BibTeX RDF
10	Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti	On the Clustered Shortest-Path Tree Problem.	ICTCS	2016	DBLP BibTeX RDF
10	Stéphane Devismes, David Ilcinkas, Colette Johnen	Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.	OPODIS	2016	DBLP DOI BibTeX RDF
10	Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti	Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments.	ACM J. Exp. Algorithmics	2015	DBLP DOI BibTeX RDF
10	Binay Bhattacharya, Tsunehiko Kameda, Zhao Song 0002	Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks.	Discret. Appl. Math.	2015	DBLP DOI BibTeX RDF
10	Abhijit Bhattacharya, Anurag Kumar 0001	A shortest path tree based algorithm for relay placement in a wireless sensor network and its performance analysis.	Comput. Networks	2014	DBLP DOI BibTeX RDF
10	Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen	Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks.	SSS	2014	DBLP DOI BibTeX RDF
10	Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti	Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.	SEA	2014	DBLP DOI BibTeX RDF
10	Anjeneya Swami Kare, Sanjeev Saxena	Swap Edges of Shortest Path Tree in Parallel.	RAIT	2014	DBLP DOI BibTeX RDF
10	Binay K. Bhattacharya, Minati De, Tsunehiko Kameda, Sasanka Roy, Vladyslav Sokol, Zhao Song 0002	Back-Up 2-Center on a Path/Tree/Cycle/Unicycle.	COCOON	2014	DBLP DOI BibTeX RDF
10	Hong Qu, Zhang Yi 0001, Simon X. Yang	Efficient Shortest-Path-Tree Computation in Network Routing Based on Pulse-Coupled Neural Networks.	IEEE Trans. Cybern.	2013	DBLP DOI BibTeX RDF
10	Xiaoge Zhang 0001, Qi Liu, Yong Hu 0002, Felix T. S. Chan, Sankaran Mahadevan, Zili Zhang 0001, Yong Deng 0001	An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs.	CoRR	2013	DBLP BibTeX RDF
10	Mariusz Glabowski, Bartosz Musznicki, Przemyslaw Nowak, Piotr Zwierzykowski	An Algorithm for Finding Shortest Path Tree Using Ant Colony Optimization Metaheuristic.	IP&C	2013	DBLP DOI BibTeX RDF
10	Francisco R. Fernández, Justo Puerto	The minimum cost shortest-path tree game.	Ann. Oper. Res.	2012	DBLP DOI BibTeX RDF