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

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

Robust estimation of location and scatter by pruning the minimum spanning tree
Congestion network problems and related games
First vs. best improvement: an empirical study
The \(P\)-value for cost sharing in minimum
Algorithms to test open set condition for self-similar set related to P.V. numbers
Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
Savings based ant colony optimization for the capacitated minimum spanning tree problem
Fast reoptimization for the minimum spanning tree problem
Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
The vertex degrees of minimum spanning trees
Combinatorial optimisation and hierarchical classifications
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
A survey on combinatorial optimization in dynamic environments
The problem of the optimal biobjective spanning tree
On some algorithmic aspects of hypergraphic matroids
Random minimal directed spanning trees and Dickman-type distributions
A survey of combinatorial optimization problems in multicast routing
The central limit theorem for Euclidean minimal spanning trees. I
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
Valuated matroids: A new look at the greedy algorithm
A tolerance-based heuristic approach for the weighted independent set problem
The central limit theorem for weighted minimal spanning trees on random points
Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs
Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
An evolutionary approach for finding optimal trees in undirected networks
Minimum spanning trees for tree metrics: Abridgements and adjustments
On the value of a random minimum spanning tree problem
Minimum-weight spanning tree algorithms. A survey and empirical study
Self-similar fractals: an algorithmic point of view
Minimizing maximum risk for fair network connection with interval data
On the bicriterion - minimal cost/minimal label - spanning tree problem
On obligation rules for minimum cost spanning tree problems
Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
The tree-star problem: a formulation and a branch-and-cut algorithm
An algorithm for \(k^{\text{th}}\) minimum spanning tree
Algorithm for the discrete Weber's problem with an accuracy estimate
Improved bounds for large scale capacitated arc routing problem
A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services
Genetic algorithm approach on multi-criteria minimum spanning tree problem
Combinatorial optimization with one quadratic term: spanning trees and forests
Resistant estimation of multivariate location using minimum spanning trees
Title not available (Why is that?)
Computing the asymptotic spectrum for networks representing energy landscapes using the minimum spanning tree
Choquet optimal set in biobjective combinatorial optimization
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
An efficient algorithm for minimumk-covers in weighted graphs
A decision-theoretic approach to robust optimization in multivalued graphs
Characterization of monotonic rules in minimum cost spanning tree problems
A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
Lower bounds and exact algorithms for the quadratic minimum spanning tree problem
Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
A branch and bound algorithm for the robust spanning tree problem with interval data
A partition-based relaxation for Steiner trees
Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
Exact algorithms for finding constrained minimum spanning trees
A faster approximation algorithm for the Steiner problem in graphs
A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
A graph theoretical bound for the p-median problem
Non delayed relax-and-cut algorithms
Dynamic programming based heuristics for the topological design of local access networks
Topological design of telecommunication networks --- local access design methods
A GRASP algorithm for the multi-criteria minimum spanning tree problem
The degree and cost adjusted folk solution for minimum cost spanning tree games
Intersection representations of matrices by subtrees and unicycles on graphs
Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
Infrastructure development for conversion to environmentally friendly fuel
Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
Efficient algorithms for divisive hierarchical clustering with the diameter criterion
An effective genetic algorithm approach to the quadratic minimum spanning tree problem
Measures of uncertainty in market network analysis
New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints
Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem
Finding the most vital edge with respect to minimum spanning tree in weighted graphs
Bicriteria path problem minimizing the cost and minimizing the number of labels
Inference and Learning in Multi-dimensional Bayesian Network Classifiers
Minimum deviation problems
A class of growth models rescaling to KPZ
Critical random graphs and the structure of a minimum spanning tree
Fuzzy quadratic minimum spanning tree problem
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

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)