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

Cited in

(only showing first 100 items - show all)

The subdivision-constrained minimum spanning tree problem
Light orthogonal networks with constant geometric dilation
Cost allocation protocols for supply contract design in network situations
Assessing probabilistic forecasts of multivariate quantities, with an application to ensemble predictions of surface winds
The \(S\)-digraph optimization problem and the greedy algorithm
A graph approach to generate all possible regression submodels
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
A mixed integer linear formulation for the minimum label spanning tree problem
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Optimality conditions in preference-based spanning tree problems
Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
Is VAT really single linkage in disguise?
Hybrid systems: From verification to falsification by combining motion planning and discrete search
New variants of pairwise classification
Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
Planar bichromatic minimum spanning trees
Opportune moment strategies for a cost spanning tree game
Topological-based bottleneck analysis and improvement strategies for traffic networks
Computational experience with minimum spanning tree algorithms
Arbres minimaux d'un graphe preordonne
On computing all north-east nearest neighbors in the \(L_ 1\) metric
On the value of a random minimum spanning tree problem
Generalized Steiner problem in outerplanar networks
Testing the theory of evolution: A novel application of combinatorial optimization
Multi-terminal maximum flows in node-capacitated networks
Most and least uniform spanning trees
Maximum of k-th maximal spanning trees of a weighted graph
The telephonic switching centre network problem: Formalization and computational experience
Minimum deviation problems
Graph theoretic foundations of pathfinder networks
Two probabilistic results on rectilinear Steiner trees
On a proposed divide-and-conquer minimal spanning tree algorithm
Reducing the hierarchical network design problem
A Lagrangean approach to the degree-constrained minimum spanning tree problem
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
The planar multiterminal cut problem
The greedy algorithm for partially ordered sets
Proving phylogenetic trees minimal with l-clustering and set partitioning
The design and analysis of a new hybrid sorting algorithm
A graph theoretical bound for the p-median problem
Optimal planning of network structures within an exchange area
mstclustering
Heuristics and their design: A survey
Finding minimal spanning trees in a Euclidean coordinate space
Stochastic spanning tree problem
A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
On the relationship between the biconnectivity augmentation and traveling salesman problems
Minimal spanning trees and partial sorting
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
Parallel computation and conflicts in memory access
Efficient algorithms for divisive hierarchical clustering with the diameter criterion
The Steiner ratio conjecture for six points
Topological design of telecommunication networks --- local access design methods
Dynamic programming based heuristics for the topological design of local access networks
Finding the most vital edge with respect to minimum spanning tree in weighted graphs
How to find Steiner minimal trees in Euclidean \(d\)-space
Path-distance heuristic for the Steiner problem in undirected networks
A heuristic for Euclidean and rectilinear Steiner problems
An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
Steiner's problem in graphs: Heuristic methods
On the spanning trees of weighted graphs
Über die Bestimmung minimaler Wege und Gerüste in Graphen
Some applications of graph theory to clustering
Priority queues with update and finding minimum spanning trees
A combinatorial ranking problem
Data analysis implications of some concepts related to the cuts of a graph
Min-max optimization of several classical discrete optimization problems
\(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
A heuristic algorithm for the mini-max spanning forest problem
Planning models for freight transportation
A branch-and-bound algorithm for the mini-max spanning forest problem
A dynamic programming heuristic for the \(P\)-median problem
Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint
New edges not used in shortest tours of TSP
A neural network for the Steiner minimal tree problem
A primal-dual approximation algorithm for the Steiner forest problem
The hybrid spanning tree problem
Ripser: efficient computation of Vietoris-Rips persistence barcodes
On spanning tree problems with multiple objectives
Operations research games: A survey. (With comments and rejoinder)
Bounds for the frequency assignment problem
On bicriterion minimal spanning trees: An approximation
Parallel benchmarks of turbulence in complex geometries
Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\)
The central limit theorem for Euclidean minimal spanning trees. I
An effective genetic algorithm approach to the quadratic minimum spanning tree problem
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
Minimum cost spanning tree games and population monotonic allocation schemes.
On the complexity of graph tree partition problems.
Tail bound for the minimal spanning tree of a complete graph.
Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers.
An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
On shortest three-edge-connected Steiner networks with Euclidean distance
Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
Heuristic procedure neural networks for the CMST problem
An evolutionary approach for finding optimal trees in undirected networks
The vertex degrees of minimum spanning trees
Digital data networks design using genetic algorithms

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)