Search results for "spanning"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
85	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
67	Chung-Hao Chang, Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, Lih-Hsing Hsu	The super spanning connectivity and super spanning laceability of the enhanced hypercubes.	J. Supercomput.	2009	DBLP DOI BibTeX RDF	Folded hypercubes, Enhanced hypercubes, Hamiltonian laceable, Super spanning connected, Super spanning laceable, Hamiltonian connected
63	Bryant A. Julstrom, Günther R. Raidl	Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.	SAC	2002	DBLP DOI BibTeX RDF	random spanning trees, sets of edges, spanning trees, initialization
62	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
57	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
57	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
56	Kayhan Erciyes, Deniz Ozsoyeller, Orhan Dagdeviren	Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks.	ICCS (1)	2008	DBLP DOI BibTeX RDF	clustering, wireless sensor networks, synchronizers, spanning tree
56	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
56	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
56	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
56	Dae-Young Seo, D. T. Lee, Tien-Ching Lin	Geometric Minimum Diameter Minimum Cost Spanning Tree Problem.	ISAAC	2009	DBLP DOI BibTeX RDF
56	Sergey Bereg, Minghui Jiang 0001, Boting Yang, Binhai Zhu	On the Red/Blue Spanning Tree Problem.	TAMC	2009	DBLP DOI BibTeX RDF
56	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
56	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
52	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
51	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
51	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
51	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
51	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
51	Mohammad Sohel Rahman, Mohammod Abul Kashem	Degree restricted spanning trees of graphs.	SAC	2004	DBLP DOI BibTeX RDF	algorithms, graphs, NP-completeness, spanning trees, Hamiltonian path
51	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
51	Martina Marré, Antonia Bertolino	Using Spanning Sets for Coverage Testing.	IEEE Trans. Software Eng.	2003	DBLP DOI BibTeX RDF	ddgraph, spanning sets, data flow, Control flow, subsumption, coverage criteria
51	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
50	Aref Meddeb	Smart Spanning Tree Bridging for Metro Ethernets.	LCN	2008	DBLP DOI BibTeX RDF
50	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
50	Hai Zhou 0001, Narendra V. Shenoy, William Nicholls	Efficient minimum spanning tree construction without Delaunay triangulation.	ASP-DAC	2001	DBLP DOI BibTeX RDF
49	Yongsuk Kim, Sirkka L. Jarvenpaa	Formal Boundary Spanning and Informal Boundary Spanning in Cross-Border Knowledge Sharing: A Case Study.	HICSS	2008	DBLP DOI BibTeX RDF
47	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
46	Martina Marré, Antonia Bertolino	Unconstrained Duals and Their Use in Achieving All-Uses Coverage.	ISSTA	1996	DBLP DOI BibTeX RDF
46	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
45	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
45	Raja Jothi, Balaji Raghavachari	Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	approximation algorithms, network design, Spanning trees, minimum spanning trees
45	Lélia Blin, Franck Butelle	The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs.	IPDPS	2003	DBLP DOI BibTeX RDF	Minimum degree spanning trees, Distributed algorithms, Spanning trees, Asynchronous algorithms, general graphs
45	Giuseppe F. Italiano, Rajiv Ramaswami	Maintaining Spanning Trees of Small Diameter.	Algorithmica	1998	DBLP DOI BibTeX RDF	Design and analysis of algorithms and data structures, Design and analysis of algorithms and data structures, Spanning trees, Spanning trees, Key words
45	Yury Nikulin	Simulated annealing algorithm for the robust spanning tree problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Robust spanning tree, Simulated annealing, Uncertainty
45	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
45	Mohit Singh, Lap Chi Lau	Approximating minimum bounded degree spanning trees to within one of optimal.	STOC	2007	DBLP DOI BibTeX RDF	approximation algorithm, spanning trees, bounded degree, iterative rounding
45	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
45	Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang	Constructing Light Spanning Trees with Small Routing Cost.	STACS	1999	DBLP DOI BibTeX RDF	approximation algorithms, network design, spanning trees
45	Yuval Emek	k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.	ESA	2009	DBLP DOI BibTeX RDF
45	Martin Harrigan, Patrick Healy	Efficiently drawing a significant spanning tree of a directed graph.	APVIS	2007	DBLP DOI BibTeX RDF
45	Frank Neumann 0001, Marco Laumanns	Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.	LATIN	2006	DBLP DOI BibTeX RDF
45	David A. Bader, Guojing Cong	A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors.	IPDPS	2004	DBLP DOI BibTeX RDF
45	David Peleg, Eilon Reshef	Deterministic Polylog Approximation for Minimum Communication Spanning Trees.	ICALP	1998	DBLP DOI BibTeX RDF
45	Thomas Andreae, Michael Nölle, Gerald Schreiber	Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF	processor networks, parallel image processing and pattern recognition, dilation, graph embeddings, massively parallel computers, Cartesian product, de Bruijn graphs
44	Andy N. C. Kang, Richard C. T. Lee, Chin-Liang Chang, Shi-Kuo Chang	Storage Reduction Through Minimal Spanning Trees and Spanning Forests.	IEEE Trans. Computers	1977	DBLP DOI BibTeX RDF	memory storage reduction, spanning forests, Analysis of algorithms, minimal spanning trees
41	Jochen Könemann, R. Ravi 0001	Primal-dual meets local search: approximating MST's with nonuniform degree bounds.	STOC	2003	DBLP DOI BibTeX RDF	degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation
40	Jenn-Yang Tien, Ching-Tien Ho, Wei-Pang Yang	Broadcasting on incomplete hypercubes.	SPDP	1991	DBLP DOI BibTeX RDF
39	Seunghwa Kang, David A. Bader	An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs.	PPoPP	2009	DBLP DOI BibTeX RDF	minimum spanning forest, transactional memory, minimum spanning tree
39	Jochen Könemann, Asaf Levin, Amitabh Sinha	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation
39	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
39	Chung-Shou Liao, Louxin Zhang	Approximating the Spanning k-Tree Forest Problem.	FAW	2009	DBLP DOI BibTeX RDF	Spanning forest, approximation algorithm, star, k-tree
39	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
39	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
39	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
39	Arindam Khaled, Bryant A. Julstrom	Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem.	GECCO	2008	DBLP DOI BibTeX RDF	bounded labels, labeled spanning trees, genetic algorithms, local search, greedy heuristics
39	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
39	Timothy M. Chan	Euclidean bounded-degree spanning tree ratios.	SCG	2003	DBLP DOI BibTeX RDF	approximation, minimum spanning trees, discrete geometry
39	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
39	Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger	On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.	FSTTCS	2002	DBLP DOI BibTeX RDF	minimum-cost biconnected spanning subgraph, Approximation algorithm, inapproximability, augmentation
39	Seth Pettie, Vijaya Ramachandran	An Optimal Minimum Spanning Tree Algorithm.	ICALP	2000	DBLP DOI BibTeX RDF	optimal complexity, Graph algorithms, minimum spanning tree
39	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
39	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
39	Navin Goyal, Luis Rademacher, Santosh S. Vempala	Expanders via random spanning trees.	SODA	2009	DBLP DOI BibTeX RDF
39	Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov	A Moderately Exponential Time Algorithm for Full Degree Spanning Tree.	TAMC	2008	DBLP DOI BibTeX RDF
39	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
39	Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski	Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.	SOFSEM (1)	2007	DBLP DOI BibTeX RDF
39	Michel X. Goemans	Minimum Bounded Degree Spanning Trees.	FOCS	2006	DBLP DOI BibTeX RDF
39	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
39	Aili Han, Daming Zhu	DNA Computing Model for the Minimum Spanning Tree Problem.	SYNASC	2006	DBLP DOI BibTeX RDF
39	Hideo Saito, Kenjiro Taura, Takashi Chikayama	Collective operations for wide-area message passing systems using adaptive spanning trees.	GRID	2005	DBLP DOI BibTeX RDF
39	Mohammad Erfanul Hoque Siddiqi, Md. Emdadul Haque, M. Shahin, M. Belal Hossan	Spanning trees with restricted degrees for series-parallel graph.	GrC	2005	DBLP DOI BibTeX RDF
39	Refael Hassin, Asaf Levin	Approximation Algorithms for Quickest Spanning Tree Problems.	ESA	2004	DBLP DOI BibTeX RDF
39	Tetsuo Asano, Mark de Berg, Otfried Cheong, Leonidas J. Guibas, Jack Snoeyink, Hisao Tamaki	Spanning Trees Crossing Few Barriers.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
39	Lisa Higham, Zhiying Liang	Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks.	DISC	2001	DBLP DOI BibTeX RDF
39	Koji Obokata, Yukihiro Iwasaki, Feng Bao 0004, Yoshihide Igarashi	Independent Spanning Trees of Product Graphs.	WG	1996	DBLP DOI BibTeX RDF
39	Judit Bar-Ilan, Dror Zernik	Random Leaders and Random Spanning Trees.	WDAG	1989	DBLP DOI BibTeX RDF
35	Jieyi Long, Hai Zhou 0001, Seda Ogrenci Memik	An O(nlogn) edge-based algorithm for obstacle-avoiding rectilinear steiner tree construction.	ISPD	2008	DBLP DOI BibTeX RDF	minimum terminal spanning tree, spanning graph, routing, physical design, steiner tree
35	Jorge Arturo Cobb	Convergent Multi-Path Routing.	ICNP	2000	DBLP DOI BibTeX RDF	convergent multi-path routing, successor set, acyclic graph, destination graph, spanning graph, normal operating state, routing spanning tree, protocols, graph theory, routing protocol, telecommunication network routing, transient faults, communication channels, network process
35	Tadao Takaoka	Partial Solution and Entropy.	MFCS	2009	DBLP DOI BibTeX RDF	adaptive sort, minimal mergesort, ascending runs, nearly acyclic graphs, complexity, entropy, shortest paths, minimum spanning trees
35	Filip De Greve, Frederic Van Quickenborne, Filip De Turck, Ingrid Moerman, Piet Demeester	Optimizing Routing Schemes for Fast Moving Users in MST-Based Networks.	EuroNGI Workshop	2005	DBLP DOI BibTeX RDF	spanning trees, Ethernet, user mobility
35	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
35	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
35	Feng Bao 0004, Yutaka Funyu, Yukihiro Hamada, Yoshihide Igarashi	Reliable broadcasting and secure distributing in channel networks.	ISPAN	1997	DBLP DOI BibTeX RDF	channel networks, secure message distributing, message distribution schemes, secret sharing, spanning trees, security of data, reliable broadcasting, fault-tolerant communication
35	Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger	Backbone Colorings for Networks.	WG	2003	DBLP DOI BibTeX RDF
34	Juan A. Garay, Shay Kutten, David Peleg	A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees (Extended Abstract)	FOCS	1993	DBLP DOI BibTeX RDF	distributed minimum-weight spanning tree algorithm, sublinear time distributed algorithm, minimum-weight spanning trees, global network problems, n-vertex network, Diam, edge elimination techniques, time complexity, graph decomposition
34	Pankaj K. Agarwal, David Eppstein, Jirí Matousek 0001	Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees	FOCS	1992	DBLP DOI BibTeX RDF	Euclidean minimum spanning tree, half-space range reporting, minima, decomposable function, closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest pair, minimum spanning trees, diameter, dynamic data structures, geometric optimization, geometric problems
33	Stefan Rennick Egglestone, Andy Boucher 0002, Tom Rodden, Andy Law, Jan Humble, Chris Greenhalgh	Supporting the design of network-spanning applications.	CHI Extended Abstracts	2009	DBLP DOI BibTeX RDF	component-orientation., network-spanning applications, interaction design, toolkit
33	Martin Gruber, Günther R. Raidl	Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances.	GECCO	2009	DBLP DOI BibTeX RDF	bounded diameter minimum spanning tree, construction heuristics, greedy randomized search, local improvement, dynamic programming
33	Alejandro Cornejo, Nancy A. Lynch	Brief announcement: minimum spanning trees and cone-based topology control.	PODC	2009	DBLP DOI BibTeX RDF	topology control, minimum spanning trees
33	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
33	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
33	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
33	Benjamin Klöpper, Herbert Podlogar, Jürgen Gausemeier, Katrin Witting	Domain Spanning Search for the Identification of Solution Patterns for the Conceptual Design of Self-Optimizing Systems.	DEXA Workshops	2008	DBLP DOI BibTeX RDF	domain spanning search, conceptual design, self-optimization
33	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
33	Rajeev Kumar 0004, Pramod Kumar Singh	On quality performance of heuristic and evolutionary algorithms for biobjective minimum spanning trees.	GECCO	2007	DBLP DOI BibTeX RDF	genetic algorithm, heuristics, combinatorial optimization, multiobjective optimization, spanning tree
33	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
33	Maleq Khan, Gopal Pandurangan	A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.	DISC	2006	DBLP DOI BibTeX RDF	Minimum Spanning Tree, Distributed Approximation Algorithm
33	Michael Elkin, Yuval Emek, Daniel A. Spielman, Shang-Hua Teng	Lower-stretch spanning trees.	STOC	2005	DBLP DOI BibTeX RDF	low-distortion embeddings, low-stretch spanning trees, probabilistic tree metrics
33	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