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

Cited in

(only showing first 100 items - show all)

Constructing near spanning trees with few local inspections
A mixed integer linear formulation for the minimum label spanning tree problem
Robust estimation of location and scatter by pruning the minimum spanning tree
Reducing the hierarchical network design problem
Application of a generalized Sherman-Morrison formula to the computation of network Green's functions and the construction of spanning trees
A class of growth models rescaling to KPZ
Critical random graphs and the structure of a minimum spanning tree
Steiner Minimal Tree for Points on a Circle
Generalized correlation dimension and heterogeneity of network spaces
Parametric controllability of the personalized PageRank: Classic model vs biplex approach
Congestion network problems and related games
First vs. best improvement: an empirical study
The P-value for cost sharing in minimum
A template-based adaptive large neighborhood search for the consistent vehicle routing 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
Local mutual information for dissimilarity-based image segmentation
Algorithms to test open set condition for self-similar set related to P.V. numbers
THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context
Computing capacitated minimal spanning trees efficiently
Lens data depth and median
The folk rule for minimum cost spanning tree problems with multiple sources
Using tours to visually investigate properties of new projection pursuit indexes with application to problems in physics
Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
A hybrid method for improved critical points for multiple comparisons
Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
A combinatorial approach to assess the separability of clusters
A metaheuristic for the time-dependent pollution-routing problem
New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
A characterization of kruskal sharing rules for minimum cost spanning tree problems
Optimality conditions in preference-based spanning tree problems
An efficient filtering algorithm for the unary resource constraint with transition times and optional activities
scientific article; zbMATH DE number 7650127 (Why is no real title available?)
Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
A hybrid algorithm for the solution of a single commodity spatial equilibrium model
Graph theoretic foundations of pathfinder networks
Ultrametric Watersheds
Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
Fast Synchronization in P Systems
Survivable networks, linear programming relaxations and the parsimonious property
Fast reoptimization for the minimum spanning tree problem
The expected complexity of Prim's minimum spanning tree algorithm
Hurst analysis of dynamic networks
Savings based ant colony optimization for the capacitated minimum spanning tree problem
Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
The traveling salesman problem with backhauls
The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
The subdivision-constrained minimum spanning tree problem
An Event-Driven Algorithm for Agents on the Web
Fast Constrained Image Segmentation Using Optimal Spanning Trees
Disjoint paths in sparse graphs
Maintaining dynamic minimum spanning trees: an experimental study
Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
On sorting, heaps, and minimum spanning trees
A fractal dimension for measures via persistent homology
Perturbative quantum field theory on random trees
On computing all north-east nearest neighbors in the \(L_ 1\) metric
NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
An \(H^{1}\)-conforming solenoidal basis for velocity computation on Powell-Sabin splits for the Stokes problem
Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
The cable trench problem: Combining the shortest path and minimum spanning tree problems
Robust multivariate nonparametric tests via projection averaging
The vertex degrees of minimum spanning trees
Adaptive evolutionary algorithm based on a cliqued Gibbs sampling over graphical Markov model structure
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Minimum cuts and sparsification in hypergraphs
Combinatorial optimisation and hierarchical classifications
A Moderately Exponential Time Algorithm for Full Degree Spanning Tree
A general system for heuristic minimization of convex functions over non-convex sets
The planar multiterminal cut problem
Dynamic Shapley Value for Two-Stage Cost Sharing Game
The vehicle routing problem with time windows and flexible delivery locations
Contractors' minimum spanning tree
A survey on combinatorial optimization in dynamic environments
The 1-Steiner-Minimal-Tree problem in Minkowski-spaces
Planar bichromatic minimum spanning trees
Modeling and solving the angular constrained minimum spanning tree problem
Exposed circuits, linear quotients, and chordal clutters
A higher-dimensional homologically persistent skeleton
Unsupervised training of Bayesian networks for data clustering
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
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
New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints
VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
A 3/2-approximation algorithm for some minimum-cost graph problems
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
An egalitarian solution to minimum cost spanning tree problems
Algorithm for sequential construction of spanning minimal directed forests
The problem of the optimal biobjective spanning tree
Development of group setup strategies for makespan minimisation in PCB assembly
Solving the optimum communication spanning tree problem
On some algorithmic aspects of hypergraphic matroids
Recursive max-linear models with propagating noise
Hierarchies in communities of UK stock market from the perspective of Brexit
The relationship between carbon dioxide emission and economic growth: hierarchical structure methods
Discriminant analysis with Gaussian graphical tree models
On the complexity of the cable-trench problem
Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem

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)