On the shortest spanning subtree of a graph and the traveling salesman problem

Cited In (only showing first 100 items - show all)

Reducing the hierarchical network design problem
Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
Decomposing a relation into a tree of binary relations
Optimality conditions in preference-based spanning tree problems
A characterization of kruskal sharing rules for minimum cost spanning tree problems
Graph theoretic foundations of pathfinder networks
Survivable networks, linear programming relaxations and the parsimonious property
The traveling salesman problem with backhauls
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
Planar bichromatic minimum spanning trees
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
Cost sharing in networks: some open questions
Light orthogonal networks with constant geometric dilation
Simulated annealing algorithm for the robust spanning tree problem
Topological-based bottleneck analysis and improvement strategies for traffic networks
Arbres minimaux d'un graphe preordonne
A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set
The power of multimedia: Combining point-to-point and multi-access networks
New lower bounds for the symmetric travelling salesman problem
Traveling salesman games with the Monge property
Minimal congestion trees
A simple, faster method for kinetic proximity problems
Advances in Constrained Connectivity
Kinetic Euclidean minimum spanning tree in the plane
Growing spanning trees in plasmodium machines
Generalized Steiner problem in outerplanar networks
The computation of nearly minimal Steiner trees in graphs
Data analysis implications of some concepts related to the cuts of a graph
Fuzzy \(\alpha\)-minimum spanning tree problem: definition and solutions
The saga of minimum spanning trees
Learning from imprecise data: possibilistic graphical models.
Decentralized pricing in minimum cost spanning trees
Some applications of graph theory to clustering
An adaptive large neighborhood search approach for multiple traveling repairman problem with profits
The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
Is VAT really single linkage in disguise?
On type-2 fuzzy weighted minimum spanning tree
OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS
Constructing minimum-interference networks
Most and least uniform spanning trees
Interacting loop ensembles and Bose gases
A GRASP heuristic for slab scheduling at continuous casters
Partitioning bispanning graphs into spanning trees
Title not available (Why is that?)
A class of web-based facets for the generalized vertex packing problem
Sequences of spanning trees and a fixed tree theorem
Maximum of k-th maximal spanning trees of a weighted graph
Hybrid systems: From verification to falsification by combining motion planning and discrete search
Average update times for fully-dynamic all-pairs shortest paths
The greedy algorithm for partially ordered sets
Minimum sum of diameters clustering
Path-distance heuristic for the Steiner problem in undirected networks
The minimum spanning tree problem on a planar graph
An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
Sharing the cost of maximum quality optimal spanning trees
The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
Fractional virus epidemic model on financial networks
Branch-and-cut approaches for \(p\)-cluster editing
A variational approach to the Steiner network problem
The telephonic switching centre network problem: Formalization and computational experience
Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
Balancing minimum spanning trees and shortest-path trees
The Steiner ratio conjecture for six points
Spanning-tree games
Network design under general wireless interference
On bicriterion minimal spanning trees: An approximation
The optimistic \(TU\) game in minimum cost spanning tree problems
Testing the theory of evolution: A novel application of combinatorial optimization
A dynamic programming heuristic for the \(P\)-median problem
Minimum cost spanning tree problems as value sharing problems
``Minimax length links of a dissimilarity matrix and minimum spanning trees
Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
Steiner Minimal Tree for Points on a Circle
A fast minimum spanning tree algorithm based on \(K\)-means
Exact evaluation of targeted stochastic watershed cuts
A mixed integer linear formulation for the minimum label spanning tree problem
Computing capacitated minimal spanning trees efficiently
Title not available (Why is that?)
A hybrid algorithm for the solution of a single commodity spatial equilibrium model
Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
The subdivision-constrained minimum spanning tree problem
The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
On computing all north-east nearest neighbors in the \(L_ 1\) metric
Minimum cuts and sparsification in hypergraphs
A higher-dimensional homologically persistent skeleton
A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
Note on the structure of Kruskal's algorithm
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
Successive minimum spanning trees
An adaptive minimum spanning tree multielement method for uncertainty quantification of smooth and discontinuous responses
Revisiting dynamic programming for finding optimal subtrees in trees
Robust inference of trees
Coupled network approach to predictability of financial market returns and news sentiments
Exact solution approaches for the multi-period degree constrained minimum spanning tree problem
Verifying minimum spanning tree algorithms with Stone relation algebras
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances

This page was built for publication: On the shortest spanning subtree of a graph and the traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q115238)