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

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

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
Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
Computational experience with minimum spanning tree algorithms
From reaction-diffusion to physarum computing
The traveling salesman problem: A duality approach
Network-based identification of reliable bio-markers for cancers
On the complexity of graph tree partition problems.
A new approach for the multiobjective minimum spanning tree
The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
Stock market prediction and portfolio selection models: a survey
Noncooperative cost spanning tree games with budget restrictions
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
Combinatorial optimisation algorithms for a CAD workstation
Finding multi-objective supported efficient spanning trees
Models of random subtrees of a graph
Subset complement addition upper bounds. An improved inclusion-exclusion method
A branch-and-cut algorithm for the maximum covering cycle problem
The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
Active image clustering with pairwise constraints from humans
A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
Two probabilistic results on rectilinear Steiner trees
Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\)
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
Selecting the length of a principal curve within a Gaussian model
Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
The design and analysis of a new hybrid sorting algorithm
On the probabilistic minimum coloring and minimum \(k\)-coloring
On the equivalence between hierarchical segmentations and ultrametric watersheds
Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
Hypercubes defined on \(n\)-ary sets, the Erdös-Faber-Lovász conjecture on graph coloring, and the description spaces of polypeptides and RNA
A greedy algorithm for solving a certain class of linear programmes
A combinatorial ranking problem
Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
Hepp's bound for Feynman graphs and matroids
Path optimality conditions for minimum spanning tree problem with uncertain edge weights
Heuristics and their design: A survey
Stochastic spanning tree problem
The scaling limits of the minimal spanning tree and invasion percolation in the plane
Greedy can beat pure dynamic programming
Finding bounded diameter minimum spanning tree in general graphs
Priority queues with update and finding minimum spanning trees
A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects
Globally and locally minimal weight spanning tree networks
Operations and evaluation measures for learning possibilistic graphical models
Multi-terminal maximum flows in node-capacitated networks
Upper and lower bounding strategies for the generalized minimum spanning tree problem
A template-based adaptive large neighborhood search for the consistent vehicle routing problem
Using tours to visually investigate properties of new projection pursuit indexes with application to problems in physics
Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
A combinatorial approach to assess the separability of clusters
Fast Constrained Image Segmentation Using Optimal Spanning Trees
Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
The traveling-salesman problem and minimum spanning trees: Part II
Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem
Double scaling in tensor models with a quartic interaction
A Lagrangean approach to the degree-constrained minimum spanning tree problem
Generalized minimum spanning tree games
Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers.
Planning models for freight transportation
\(N\)-dimensional Boolean hypercubes and the Goldbach conjecture
Linear estimating equations for exponential families with application to Gaussian linear concentration models
On the revealed preference analysis of stable aggregate matchings
Reduced clique graphs of chordal graphs
Multiperiod location-routing with decoupled time scales
Generalized constructive tree weights
New variants of pairwise classification
Maximising the worth of nascent networks
On estimation of the diagonal elements of a sparse precision matrix
Constructive tensor field theory
Optimal topological simplification of discrete functions on surfaces
Low-degree minimum spanning trees
Three-way distances
Axiomatization of the Shapley value on minimum cost spanning tree games
How to resum Feynman graphs

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)