Search results for "Spanning-Tree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
127	Guojing Cong, David A. Bader	The Euler Tour Technique and Parallel Rooted Spanning Tree.	ICPP	2004	DBLP DOI BibTeX RDF	High-Performance Algorithm Engineering, Shared Memory, Spanning Tree, Parallel Graph Algorithms, Euler Tour
86	Prabha Sharma	Algorithms for the optimum communication spanning tree problem.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Cost of communication, Cut-tree, Star-tree, Adjacent spanning tree, Adjacent basic feasible solution
80	Elena Prieto-Rodriguez, Christian Sloper	Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree.	WADS	2003	DBLP DOI BibTeX RDF
77	Sergey Bereg, Minghui Jiang 0001, Boting Yang, Binhai Zhu	On the Red/Blue Spanning Tree Problem.	TAMC	2009	DBLP DOI BibTeX RDF
75	Dae-Young Seo, D. T. Lee, Tien-Ching Lin	Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
74	Thang Nguyen Bui, Catherine M. Zrncic	An ant-based algorithm for finding degree-constrained minimum spanning tree.	GECCO	2006	DBLP DOI BibTeX RDF	degree constrained spanning tree, ant algorithm
74	Refael Hassin, Asaf Levin	Approximation Algorithms for Quickest Spanning Tree Problems.	Algorithmica	2005	DBLP DOI BibTeX RDF	Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms
74	Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang	Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems.	ICCSA (3)	2004	DBLP DOI BibTeX RDF	approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem
71	Aref Meddeb	Smart Spanning Tree Bridging for Metro Ethernets.	LCN	2008	DBLP DOI BibTeX RDF
67	Hai Zhou 0001, Narendra V. Shenoy, William Nicholls	Efficient minimum spanning tree construction without Delaunay triangulation.	ASP-DAC	2001	DBLP DOI BibTeX RDF
66	Martin Harrigan, Patrick Healy	Efficiently drawing a significant spanning tree of a directed graph.	APVIS	2007	DBLP DOI BibTeX RDF
66	Yury Nikulin	Simulated annealing algorithm for the robust spanning tree problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Robust spanning tree, Simulated annealing, Uncertainty
66	Alok Singh 0001, Ashok Kumar Gupta	Improved heuristics for the bounded-diameter minimum spanning tree problem.	Soft Comput.	2007	DBLP DOI BibTeX RDF	Bounded-diameter minimum spanning tree problem, Uniform order-based crossover, Constrained optimization, Greedy heuristic, Steady-state genetic algorithm
66	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.	ESA	2005	DBLP DOI BibTeX RDF	min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas
66	David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth	Tight bounds for connecting sites across barriers.	SCG	2006	DBLP DOI BibTeX RDF	spanning trees, crossing number
63	David A. Bader, Guojing Cong	A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors.	IPDPS	2004	DBLP DOI BibTeX RDF
61	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang	Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.	ISAAC	1998	DBLP DOI BibTeX RDF	approximation algorithms, network design, spanning trees
58	Baruch Awerbuch, Israel Cidon, Shay Kutten	Optimal maintenance of a spanning tree.	J. ACM	2008	DBLP DOI BibTeX RDF	optimal message complexity, Distributed algorithms, spanning tree, leader election, dynamic networks, topological changes, amortized complexity
58	Kazuhiro Suzuki	A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Heterochromatic, Spanning tree, Edge-coloring, Rainbow, Multicolored
58	Li-Jen Mao, Sheau-Dong Lang	Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique.	ICPP Workshops	2002	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal
58	Seth Pettie, Vijaya Ramachandran	An Optimal Minimum Spanning Tree Algorithm.	ICALP	2000	DBLP DOI BibTeX RDF	optimal complexity, Graph algorithms, minimum spanning tree
55	Seth Pettie, Vijaya Ramachandran	Randomized minimum spanning tree algorithms using exponentially fewer random bits.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Graph algorithms, minimum spanning trees, random sampling
55	Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov	A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.	TAMC	2008	DBLP DOI BibTeX RDF
55	Minh N. Doan	An effective ant-based algorithm for the degree-constrained minimum spanning tree problem.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
55	Refael Hassin, Asaf Levin	Approximation Algorithms for Quickest Spanning Tree Problems.	ESA	2004	DBLP DOI BibTeX RDF
55	Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang	A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.	ISPAN	1999	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree
55	David W. Krumme, Eynat Rafalin, Diane L. Souvaine, Csaba D. Tóth	Tight Bounds for Connecting Sites Across Barriers.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Spanning trees, Crossing number
55	Stefan Voß 0001	Capacitated Minimum Spanning Trees.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Capacitated minimum spanning tree problem, Terminal layout problem, Resource-constrained minimum spanning tree problem, Combinatorial optimization, Telecommunication, Spanning tree
54	Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal 0001, Jack Snoeyink	Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.	Algorithmica	2004	DBLP DOI BibTeX RDF	Minimum diameter spanning tree, Approximation algorithm, Geometric graph
54	Takeaki Uno	An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph.	ISAAC	1996	DBLP DOI BibTeX RDF	directed spanning tree, listing, enumerating algorithm
53	Amaro F. de Sousa	Improving Load Balance and Resilience of Ethernet Carrier Networks with IEEE 802.1S Multiple Spanning Tree Protocol.	ICN/ICONS/MCL	2006	DBLP DOI BibTeX RDF
53	Aili Han, Daming Zhu	DNA Computing Model for the Minimum Spanning Tree Problem.	SYNASC	2006	DBLP DOI BibTeX RDF
53	Lisa Higham, Zhiying Liang	Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks.	DISC	2001	DBLP DOI BibTeX RDF
53	José Elias Claudio Arroyo, Pedro Sampaio Vieira, Dalessandro Soares Vianna	A GRASP algorithm for the multi-criteria minimum spanning tree problem.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	GRASP algorithm, Multi-criteria combinatorial optimization, Minimum spanning tree
53	Dorabella Santos, Amaro de Sousa, Filipe Pereira Alvelos	Traffic Engineering of Telecommunication Networks Based on Multiple Spanning Tree Routing.	FITraMEn	2008	DBLP DOI BibTeX RDF	multiple spanning tree routing, integer programming, column generation
52	Bryant A. Julstrom	The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem.	GECCO	2005	DBLP DOI BibTeX RDF	blob code, edge-sets, routing cost, codings, spanning trees
52	Seth Pettie	An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38, 68W01, 68R10
52	Seth Pettie, Vijaya Ramachandran	An optimal minimum spanning tree algorithm.	J. ACM	2002	DBLP DOI BibTeX RDF	optimal complexity, Graph algorithms, minimum spanning tree
51	David Peleg, Eilon Reshef	Deterministic Polylog Approximation for Minimum Communication Spanning Trees.	ICALP	1998	DBLP DOI BibTeX RDF
51	Sylvain Dahan, Alexandru Dobrila, Jean-Marc Nicod, Laurent Philippe 0001	Performances Study of the Distributed Spanning Tree an Overlay Network for Server Lookup.	ICIW	2008	DBLP DOI BibTeX RDF	Distributed Spanning Tree, Simulations, Overlay networks
51	Hirotsugu Kakugawa, Masafumi Yamashita	A Dynamic Reconfiguration Tolerant Self-stabilizing Token Circulation Algorithm in Ad-Hoc Networks.	OPODIS	2004	DBLP DOI BibTeX RDF	ad-hoc network, self-stabilization, spanning tree, token circulation
50	Sylvain Dahan, Jean-Marc Nicod, Laurent Philippe 0001	The distributed spanning tree: a scalable interconnection topology for efficient and equitable traversal.	CCGRID	2005	DBLP DOI BibTeX RDF
50	Dimiter R. Avresky	Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes.	IEEE Trans. Parallel Distributed Syst.	1999	DBLP DOI BibTeX RDF	single and multiple faults, Fault tolerance, reconfiguration, spanning trees, faulty hypercubes
49	Andreas Darmann, Ulrich Pferschy, Joachim Schauer	Determining a Minimum Spanning Tree with Disjunctive Constraints.	ADT	2009	DBLP DOI BibTeX RDF	minimum spanning tree, conflict graph
49	Qiang He, Chee-Hung Henry Chu	A New Image Segmentation Technique Using Maximum Spanning Tree.	IWCIA	2008	DBLP DOI BibTeX RDF	affinity matrix, image segmentation, maximum spanning tree
49	Huynh Thi Thanh Binh, Truong Binh Nguyen	New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem.	PRICAI	2008	DBLP DOI BibTeX RDF	degree constrained minimum spanning tree, genetic algorithm, particle swarm optimization, swarm intelligent
49	Petrica C. Pop	On the prize-collecting generalized minimum spanning tree problem.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Generalized minimum spanning tree problem, Combinatorial optimization, Minimum spanning trees, Linear relaxation
49	Paola Flocchini, Toni Mesa Enriquez, Linda Pagli, Giuseppe Prencipe, Nicola Santoro	Distributed Computation of All Node Replacements of a Minimum Spanning Tree.	Euro-Par	2007	DBLP DOI BibTeX RDF	Replacement Tree, Distributed Algorithms, Minimum Spanning Tree, Node Failure
49	Guojing Cong, Simone Sbaraglia	A Study on the Locality Behavior of Minimum Spanning Tree Algorithms.	HiPC	2006	DBLP DOI BibTeX RDF	memory locality, graph algorithm, minimum spanning tree
49	Hsueh-I Lu, R. Ravi 0001	A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.	ISPAN	1997	DBLP DOI BibTeX RDF	Maximum-leaf spanning tree, Approximation algorithms, Performance guarantee, Approximation ratio
49	Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick	On the Spanning Ratio of Gabriel Graphs and beta-skeletons.	LATIN	2002	DBLP DOI BibTeX RDF
48	Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam	Improving Parallel Computation with Fast Integer Sorting.	COCOON	1999	DBLP DOI BibTeX RDF	Parallel algorithms, graph algorithms, minimum spanning tree, PRAM, integer sorting
47	Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé	A Linear Vertex Kernel for Maximum Internal Spanning Tree.	ISAAC	2009	DBLP DOI BibTeX RDF
47	Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis	Self-stabilizing minimum-degree spanning tree within one from the optimal degree.	IPDPS	2009	DBLP DOI BibTeX RDF
47	Xujin Chen, Jie Hu 0009, Xiaodong Hu 0001	The Minimum Risk Spanning Tree Problem.	COCOA	2007	DBLP DOI BibTeX RDF
47	Oleksandr Grygorash, Yan Zhou, Zach Jorgensen	Minimum Spanning Tree Based Clustering Algorithms.	ICTAI	2006	DBLP DOI BibTeX RDF
47	Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001	Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual.	IWPEC	2006	DBLP DOI BibTeX RDF
47	Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell	The Minimum-Area Spanning Tree Problem.	WADS	2005	DBLP DOI BibTeX RDF
47	Winfried Nöth, Reiner Kolla	Spanning Tree-based State Encoding for Low Power Dissipation.	DATE	1999	DBLP DOI BibTeX RDF
47	R. Ravi 0001, Michel X. Goemans	The Constrained Minimum Spanning Tree Problem (Extended Abstract).	SWAT	1996	DBLP DOI BibTeX RDF
47	Martin Fürer, Balaji Raghavachari	Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree.	SODA	1992	DBLP BibTeX RDF
47	Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup	Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.	J. ACM	2001	DBLP DOI BibTeX RDF	2-edge connectivity, connectivity, minimum spanning tree, dynamic graph algorithms, Biconnectivity
47	Tzung-Shi Chen, Yu-Chee Tseng, Jang-Ping Sheu	Balanced Spanning Trees in Complete and Incomplete Star Graphs.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	Balanced spanning tree, personalized broadcast, interconnection network, parallel architecture, star graph
47	Shyong Jian Shyu, Yin-Te Tsai, Richard C. T. Lee	The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	multiple sequence alignment, evolutionary tree, minimal spanning tree
46	Jingli Li, Manli Chen, Yonghong Xiang, Shaowen Yao 0001	Optimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees.	NPC	2007	DBLP DOI BibTeX RDF	(n and k)-star graph, a spanning tree, multiple spanning trees, all-port model, one-port model, all-to-all broadcasting, one-to-all broadcasting
46	Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg	Labeling Schemes for Tree Representation.	Algorithmica	2009	DBLP DOI BibTeX RDF	Spanning tree, Labeling scheme, Tree representation
46	Caetano Traina Jr., Agma J. M. Traina, Christos Faloutsos, Bernhard Seeger	Fast Indexing and Visualization of Metric Data Sets using Slim-Trees.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	metric databases, similarity search, multimedia databases, index structures, selectivity estimation, metric access methods
45	Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng	Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs.	ICIC (2)	2008	DBLP DOI BibTeX RDF
45	Zhiqiang Xie, Liang Yu, Jing Yang 0010	A Clustering Algorithm Based on Improved Minimum Spanning Tree.	FSKD (3)	2007	DBLP DOI BibTeX RDF
45	Judit Bar-Ilan, Dror Zernik	Random Leaders and Random Spanning Trees.	WDAG	1989	DBLP DOI BibTeX RDF
45	Jana van Greunen, Jan M. Rabaey	Lightweight time synchronization for sensor networks.	Wireless Sensor Networks and Applications	2003	DBLP DOI BibTeX RDF	synchronization, spanning tree, multi-hop, lightweight
44	Feodor F. Dragan, Martín Matamala	Navigating in a Graph by Aid of Its Spanning Tree.	ISAAC	2008	DBLP DOI BibTeX RDF
44	Narsingh Deo, Ayman M. Abdalla	Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.	CIAC	2000	DBLP DOI BibTeX RDF
44	Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger	Backbone Colorings for Networks.	WG	2003	DBLP DOI BibTeX RDF
44	Fangqing Gu, Hai-Lin Liu 0001, Wei Liu	A bounded diameter minimum spanning tree evolutionary algorithm based on double chromosome.	GEC Summit	2009	DBLP DOI BibTeX RDF	double chromosome, the bounded diameter minimum spanning tree, evolutionary algorithm, local search
44	Gustavo Bergantiños, Leticia Lorenzo	Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	cost spanning tree problem, optimality
44	Stavros D. Nikolopoulos, Charis Papadopoulos	The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
44	Shantanu Das 0001, Beat Gfeller, Peter Widmayer	Computing Best Swaps in Optimal Tree Spanners.	ISAAC	2008	DBLP DOI BibTeX RDF
44	Feodor F. Dragan, Chenyu Yan, Yang Xiang	Collective Additive Tree Spanners of Homogeneously Orderable Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
43	Tim Paulden, David K. Smith 0002	From the Dandelion Code to the Rainbow Code: A Class of Bijective Spanning Tree Representations With Linear Complexity and Bounded Locality.	IEEE Trans. Evol. Comput.	2006	DBLP DOI BibTeX RDF
43	Rajeev Kumar 0004, Pramod Kumar Singh, P. P. Chakrabarti 0001	Improved Quality of Solutions for Multiobjective Spanning Tree Problem Using Distributed Evolutionary Algorithm.	HiPC	2004	DBLP DOI BibTeX RDF
43	Luisa Gargano, Mikael Hammar	There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them).	ICALP	2003	DBLP DOI BibTeX RDF	Graph theory, Graph and network algorithms
43	Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang	Broadcasting on incomplete hypercubes.	SPDP	1991	DBLP DOI BibTeX RDF
42	Shaun Bangay, David de Bruyn, Kevin R. Glass	Minimum spanning trees for valley and ridge characterization in digital elevation maps.	Afrigraph	2010	DBLP DOI BibTeX RDF	graph, minimum spanning tree, line, DEM, ridge
42	Wolfgang Steitz, Franz Rothlauf	Orientation matters: how to efficiently solve ocst problems with problem-specific EAs.	GECCO	2008	DBLP DOI BibTeX RDF	optimal communications spanning tree, evolutionary algorithm, heuristics, recombination operators
42	Carlo Gaibisso, Guido Proietti, Richard B. Tan	Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs.	COCOON	2003	DBLP DOI BibTeX RDF	Transient Node Failures, Radio Networks Survivability, Planar Graphs, Minimum Spanning Tree
42	Akio Fujiyoshi	Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.	CIAA	2009	DBLP DOI BibTeX RDF
42	Hon Sun Chiu, Bin Wu 0002, Kwan Lawrence Yeung, King-Shan Lui	Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks.	WCNC	2008	DBLP DOI BibTeX RDF
42	Yang Yang 0012, Mingen Lin, Jinhui Xu 0001, Yulai Xie	Minimum Spanning Tree with Neighborhoods.	AAIM	2007	DBLP DOI BibTeX RDF
42	Jeremiah Nummela, Bryant A. Julstrom	An effective genetic algorithm for the minimum-label spanning tree problem.	GECCO	2006	DBLP DOI BibTeX RDF	labeled spanning trees, spanning subgraphs, genetic algorithms, local search, greedy heuristics
42	Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff 0001	Facility Location and the Geometric Minimum-Diameter Spanning Tree.	APPROX	2002	DBLP DOI BibTeX RDF
42	Fumihiko Shimada, Hiroaki Ishii, Takeshi Itoh	Spanning tree problem on a fuzzy network.	KES (1)	1998	DBLP DOI BibTeX RDF
42	Yuval Emek	k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.	ESA	2009	DBLP DOI BibTeX RDF
41	He Jiang, Yudong Chen	An efficient algorithm for generalized minimum spanning tree problem.	GECCO	2010	DBLP DOI BibTeX RDF	candidate set, generalized minimum spanning tree, local search
41	Longcheng Liu, Qin Wang	Constrained inverse min-max spanning tree problems under the weighted Hamming distance.	J. Glob. Optim.	2009	DBLP DOI BibTeX RDF	Min-max spanning tree, Inverse problems, Hamming distance, Strongly polynomial algorithms
41	Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishizaki, Jun Ishimatsu	A Hybrid Algorithm Based on Tabu Search and Ant Colony Optimization for k-Minimum Spanning Tree Problems.	MDAI	2009	DBLP DOI BibTeX RDF	k-minimum spanning tree, ant colony optimization, tabu search, hybrid algorithm, approximate solution
41	Sílvia M. D. Monteiro, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg	A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem.	EvoCOP	2009	DBLP DOI BibTeX RDF	Biobjective minimum spanning tree, plasmid, transgenetic algorithm
41	Huynh Thi Thanh Binh, Robert I. McKay, Nguyen Xuan Hoai, Nguyen Duc Nghia	New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem.	GECCO	2009	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, heuristic algorithm, hybrid genetic algorithm, multi-parent crossover
41	Yifeng Zeng, Jorge Cordero Hernandez, Shuyuan Lin	Spanning Tree Based Attribute Clustering.	PAKDD	2009	DBLP DOI BibTeX RDF	Clustering, Maximum Spanning Tree
41	Bin Hu 0004, Markus Leitner, Günther R. Raidl	Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Generalized minimum spanning tree, Dynamic programming, Integer linear programming, Variable neighborhood search