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

DOI10.1090/s0002-9939-1956-0078686-7zbMath0070.18404OpenAlexW1965680834WikidataQ55933607 ScholiaQ55933607MaRDI QIDQ115238

Joseph B. Kruskal, Joseph B. Kruskal

Publication date: 1956

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-1956-0078686-7

zbMATH Keywords

topology

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On minimum spanning tree-like metric spaces, Optimal parallel algorithms for multiple updates of minimum spanning trees, Sensitivity analysis for symmetric 2-peripatetic salesman problems, Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems, A decision-theoretic approach to robust optimization in multivalued graphs, A tree partition algorithm for analysis of morpholocial structure of material, Separation of partition inequalities with terminals, A survey of combinatorial optimization problems in multicast routing, Kantorovich distance on finite metric spaces: Arens-Eells norm and CUT norms, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Optimal conditions for connectedness of discretized sets, Nonlinear dependencies on Brazilian equity network from mutual information minimum spanning trees, On the bicriterion - minimal cost/minimal label - spanning tree problem, The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, A new internal index based on density core for clustering validation, Tree index of uncertain graphs, Perturbative quantum field theory on random trees, Renormalization of Feynman amplitudes on manifolds by spectral zeta regularization and blow-ups, The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable, Stabilizing social structure via modifying local patterns, Network design under general wireless interference, Active fault diagnosis: a multi-parametric approach, Spanning cactus: complexity and extensions, A voltage drop limited decentralized electric power distribution network, Generalized correlation dimension and heterogeneity of network spaces, Entanglement concentration service for the quantum Internet, An efficient filtering algorithm for the unary resource constraint with transition times and optional activities, Minimum cost spanning tree problems as value sharing problems, Optimizing synchronized truck-drone delivery with priority in disaster relief, Obligation rules for minimum cost spanning tree situations and their monotonicity properties, Hepp's bound for Feynman graphs and matroids, Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions, Using tours to visually investigate properties of new projection pursuit indexes with application to problems in physics, Second-order properties of undirected graphs, Relation-algebraic verification of Borůvka's minimum spanning tree algorithm, Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem, Faster cut sparsification of weighted graphs, The price of imperfect competition for a spanning network, Fluctuations around a homogenised semilinear random PDE, An edge-swap heuristic for generating spanning trees with minimum number of branch vertices, On the correspondence between tree representations of chordal and dually chordal graphs, Degree-constrained \(k\)-minimum spanning tree problem, ``Optimistic weighted Shapley rules in minimum cost spanning tree problems, The optimistic \(TU\) game in minimum cost spanning tree problems, COSMO: a conic operator splitting method for convex conic problems, Majority spanning trees, cotrees and their applications, Recursive max-linear models with propagating noise, Bounded-degree light approximate shortest-path trees in doubling metrics, Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem, A survey of recent developments in multiobjective optimization, Cost additive rules in minimum cost spanning tree problems with multiple sources, A Lagrangian based heuristic for the design of multipoint linkages in a communication network with unreliable links and node outage costs., Crowdshipping by employees of distribution centers: optimization approaches for matching supply and demand, A fair rule in minimum cost spanning tree problems, Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs, Resistant estimation of multivariate location using minimum spanning trees, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, Local mutual information for dissimilarity-based image segmentation, Heuristics and metaheuristics for accelerating the computation of simultaneous equations models through a Steiner tree, Combinatorial optimisation and hierarchical classifications, A tolerance-based heuristic approach for the weighted independent set problem, Self-similar fractals: an algorithmic point of view, The \(P\)-value for cost sharing in minimum, Congestion network problems and related games, Using Lagrangian dual information to generate degree constrained spanning trees, First vs. best improvement: an empirical study, On the probabilistic minimum coloring and minimum \(k\)-coloring, GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY, A polyhedral study of the generalized vertex packing problem, Minimizing maximum risk for fair network connection with interval data, Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem, An adaptive large neighborhood search approach for multiple traveling repairman problem with profits, A generalization of obligation rules for minimum cost spanning tree problems, The folk solution and Boruvka's algorithm in minimum cost spanning tree problems, A Benders decomposition approach for the robust spanning tree problem with interval data, Hypercubes defined on \(n\)-ary sets, the Erdös-Faber-Lovász conjecture on graph coloring, and the description spaces of polypeptides and RNA, The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances, A branch-and-cut algorithm for the maximum covering cycle problem, A new rule for source connection problems, A note on label propagation for semi-supervised learning, Degree bounded bottleneck spanning trees in three dimensions, Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem, A characterization of the folk rule for multi-source minimal cost spanning tree problems, Empirical study of exact algorithms for the multi-objective spanning tree, Discriminant analysis for discrete variables derived from a tree-structured graphical model, Learning directed acyclic graph SPNs in sub-quadratic time, An optimal problem in graph theory, Modeling and solving the angular constrained minimum spanning tree problem, The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources, Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices, A 3/2-approximation algorithm for some minimum-cost graph problems, Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints, Linear estimating equations for exponential families with application to Gaussian linear concentration models, Savings based ant colony optimization for the capacitated minimum spanning tree problem, A simple, faster method for kinetic proximity problems, Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks, Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations, An axiomatic approach in minimum cost spanning tree problems with groups, Approximate spanning cactus, A unified heuristic for a large class of vehicle routing problems with backhauls, Robust inference of trees, Generalized minimum spanning tree games, Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms, \(N\)-dimensional Boolean hypercubes and the Goldbach conjecture, Maximising the worth of nascent networks, On estimation of the diagonal elements of a sparse precision matrix, Constructive tensor field theory, 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, Fast approximation for computing the fractional arboricity and extraction of communities of a graph, Note on the structure of Kruskal's algorithm, 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, Revisiting dynamic programming for finding optimal subtrees in trees, Improved bounds for large scale capacitated arc routing problem, Choquet optimal set in biobjective combinatorial optimization, Looking for edge-equitable spanning trees, A biased random-key genetic algorithm for the capacitated minimum spanning tree problem, 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, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, GA topology optimization using random keys for tree encoding of structures, Minimax regret spanning arborescences under uncertain costs, Bicriteria path problem minimizing the cost and minimizing the number of labels, Decentralized pricing in minimum cost spanning trees, Robust estimation of location and scatter by pruning the minimum spanning tree, Characterization of monotonic rules in minimum cost spanning tree problems, Algorithms to test open set condition for self-similar set related to P.V. numbers, An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2, Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems, Combinatorial optimization with one quadratic term: spanning trees and forests, Reduced clique graphs of chordal graphs, Partitioning bispanning graphs into spanning trees, New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints, Active image clustering with pairwise constraints from humans, Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem, Decomposing a relation into a tree of binary relations, Multiperiod location-routing with decoupled time scales, Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs, Valuated matroids: A new look at the greedy algorithm, Average update times for fully-dynamic all-pairs shortest paths, Subset complement addition upper bounds. An improved inclusion-exclusion method, The saga of minimum spanning trees, A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems, How to resum Feynman graphs, Constructing minimum-interference networks, Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem, Computing the asymptotic spectrum for networks representing energy landscapes using the minimum spanning tree, A tabu search heuristic for the generalized minimum spanning tree problem, Search for an immobile entity on a network, A GRASP heuristic for slab scheduling at continuous casters, Intersection representations of matrices by subtrees and unicycles on graphs, Optimal topological simplification of discrete functions on surfaces, A GRASP algorithm for the multi-criteria minimum spanning tree problem, The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm, An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs, Simulated annealing algorithm for the robust spanning tree problem, Fractional virus epidemic model on financial networks, ``Minimax length links of a dissimilarity matrix and minimum spanning trees, Branch-and-cut approaches for \(p\)-cluster editing, Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem, Survivable networks, linear programming relaxations and the parsimonious property, A fast minimum spanning tree algorithm based on \(K\)-means, Exact evaluation of targeted stochastic watershed cuts, A characterization of kruskal sharing rules for minimum cost spanning tree problems, A partition-based relaxation for Steiner trees, The family of cost monotonic and cost additive rules in minimum cost spanning tree problems, Maximizing information exchange between complex networks, Disjoint paths in sparse graphs, Maintaining dynamic minimum spanning trees: an experimental study, Axiomatization of the Shapley value on minimum cost spanning tree games, A note on two problems in connexion with graphs, On sorting, heaps, and minimum spanning trees, Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems, A branch and bound algorithm for the robust spanning tree problem with interval data, Fuzzy quadratic minimum spanning tree problem, New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints, Minimum sum of diameters clustering, The power of multimedia: Combining point-to-point and multi-access networks, mstclustering, Exact solution approaches for the multi-period degree constrained minimum spanning tree problem, Ripser: efficient computation of Vietoris-Rips persistence barcodes, Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints, Heuristics for the mixed swapping problem, From reaction-diffusion to physarum computing, Double scaling in tensor models with a quartic interaction, Network-based identification of reliable bio-markers for cancers, Combinatorial optimisation algorithms for a CAD workstation, Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem, A variational approach to the Steiner network problem, Operations and evaluation measures for learning possibilistic graphical models, A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space, Optimal equilibria in the non-cooperative game associated with cost spanning tree problem, Non delayed relax-and-cut algorithms, Upper and lower bounding strategies for the generalized minimum spanning tree problem, Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem, A combinatorial approach to assess the separability of clusters, Fractal structure in the S\&P500: a correlation-based threshold network approach, Minimal congestion trees, An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization, The relationship between carbon dioxide emission and economic growth: hierarchical structure methods, The scaling limits of the minimal spanning tree and invasion percolation in the plane, Discriminant analysis with Gaussian graphical tree models, Analysis of the football transfer market network, Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic, A multi-agent transgenetic algorithm for the bi-objective spanning tree problem, Greedy can beat pure dynamic programming, A scheme for multiple sequence alignment optimization -- an improvement based on family representative mechanics features, Heuristic and exact algorithms for the spanning tree detection problem, Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem, Spanning tree of a multiple graph, A higher-dimensional homologically persistent skeleton, ILP formulation of the degree-constrained minimum spanning hierarchy problem, On residual approximation in solution extension problems, Low-degree minimum spanning trees, A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem, Finding bounded diameter minimum spanning tree in general graphs, A two-level off-grid electric distribution problem on the continuous space, Analyzing systemic risk using non-linear marginal expected shortfall and its minimum spanning tree, Balancing minimum spanning trees and shortest-path trees, Minimum spanning paths and Hausdorff distance in finite ultrametric spaces, Two-way greedy: algorithms for imperfect rationality, A new approach for the multiobjective minimum spanning tree, Vehicle routing with cross-dock selection, Confidence regional method of stochastic spanning tree problem, Three-way distances, Minimum spanning trees for tree metrics: Abridgements and adjustments, A family of block-wise one-factor distributions for modeling high-dimensional binary data, SMILE: a novel dissimilarity-based procedure for detecting sparse-specific profiles in sparse contingency tables, The traveling salesman problem with backhauls, Multigraph representations of hierarchical loglinear models, A hybrid algorithm for the solution of a single commodity spatial equilibrium model, From G-parking functions to B-parking functions, A resting-state brain functional network study in MDD based on minimum spanning tree analysis and the hierarchical clustering, Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases, A two-level solution approach for solving the generalized minimum spanning tree problem, Kinetic Euclidean minimum spanning tree in the plane, On the equivalence between hierarchical segmentations and ultrametric watersheds, Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length, Sparse causality network retrieval from short time series, On the probabilistic min spanning tree problem, A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects, Selecting the length of a principal curve within a Gaussian model, CciMST: a clustering algorithm based on minimum spanning tree and cluster centers, A practical algorithm for the minimum rectilinear Steiner tree, Characterizing rules in minimum cost spanning tree problems, Efficient minimum spanning tree algorithms on the reconfigurable mesh, The degree and cost adjusted folk solution for minimum cost spanning tree games, Kernel-based adaptive approximation of functions with discontinuities, Modified classical graph algorithms for the DNA fragment assembly problem, Sharing the cost of maximum quality optimal spanning trees, Solving the optimum communication spanning tree problem, Intrinsic dimension estimation: advances and open problems, New genetic algorithm approach for the MIN-degree constrained minimum spanning tree, A metaheuristic for the time-dependent pollution-routing problem, Verifying minimum spanning tree algorithms with Stone relation algebras, Order picking along a crane-supplied pick face: the SKU switching problem, Ordered weighted average optimization in multiobjective spanning tree problem, Robust multivariate nonparametric tests via projection averaging, Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty, Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization, An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem, Exposed circuits, linear quotients, and chordal clutters, A class of web-based facets for the generalized vertex packing problem, Asymptotics of integrals of Betti numbers for random simplicial complex processes, Measures of uncertainty in market network analysis, Extracting the sovereigns' CDS market hierarchy: a correlation-filtering approach, A unifying logic for non-deterministic, parallel and concurrent abstract state machines, Finding multi-objective supported efficient spanning trees, Stock market prediction and portfolio selection models: a survey, Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs, On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\), Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles, Topological complexity of graphs and their spanning trees, The minimum spanning tree problem on a planar graph, The problem of the optimal biobjective spanning tree, A disturbed version of the greedy algorithm, Genetic algorithm approach on multi-criteria minimum spanning tree problem, The central limit theorem for weighted minimal spanning trees on random points, The maximum weight trace alignment merging problem, Concurrent disjoint set union, A non-cooperative game theory approach to cost sharing in networks, Analysis of communities of countries with similar dynamics of the COVID-19 pandemic evolution, New lower bounds for the symmetric travelling salesman problem, Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints, Traveling salesman games with the Monge property, Constructing light spanners deterministically in near-linear time, Exact algorithms for finding constrained minimum spanning trees, The vertex degrees of minimum spanning trees, \(1\)-line minimum rectilinear Steiner trees and related problems, Approximation algorithms for solving the line-capacitated minimum Steiner tree problem, Infrastructure development for conversion to environmentally friendly fuel, An efficient and flexible multiplicity adjustment for chi-square endpoints, Digital data networks design using genetic algorithms, On some algorithmic aspects of hypergraphic matroids, On type-2 fuzzy weighted minimum spanning tree, The expected complexity of Prim's minimum spanning tree algorithm, A primal-dual approximation algorithm for the Steiner forest problem, The hybrid spanning tree problem, 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, On spanning tree problems with multiple objectives, Maximum of k-th maximal spanning trees of a weighted graph, The telephonic switching centre network problem: Formalization and computational experience, Operations research games: A survey. (With comments and rejoinder), Bounds for the frequency assignment problem, Minimum deviation problems, Graph theoretic foundations of pathfinder networks, Two probabilistic results on rectilinear Steiner trees, On bicriterion minimal spanning trees: An approximation, On a proposed divide-and-conquer minimal spanning tree algorithm, Parallel benchmarks of turbulence in complex geometries, Selection of alpha for alpha-hull in \(\mathbb{R}^ 2\), Reducing the hierarchical network design problem, A Lagrangean approach to the degree-constrained minimum spanning tree problem, The central limit theorem for Euclidean minimal spanning trees. I, A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem, The planar multiterminal cut problem, An effective genetic algorithm approach to the quadratic minimum spanning tree problem, Linear-time algorithms for parametric minimum spanning tree problems on planar graphs, 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, Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees, Heuristics and their design: A survey, Fuzzy random bottleneck spanning tree problems using possibility and necessity measures, 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, Minimum cost spanning tree games and population monotonic allocation schemes., On the complexity of graph tree partition problems., On the relationship between the biconnectivity augmentation and traveling salesman problems, Tail bound for the minimal spanning tree of a complete graph., 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, 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., 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, The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm, Some applications of graph theory to clustering, Priority queues with update and finding minimum spanning trees, On obligation rules for minimum cost spanning tree problems, A combinatorial ranking problem, The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation, Fast reoptimization for the minimum spanning tree problem, Data analysis implications of some concepts related to the cuts of a graph, The subdivision-constrained minimum spanning tree problem, Light orthogonal networks with constant geometric dilation, Cost allocation protocols for supply contract design in network situations, Min-max optimization of several classical discrete optimization problems, Assessing probabilistic forecasts of multivariate quantities, with an application to ensemble predictions of surface winds, The \(S\)-digraph optimization problem and the greedy algorithm, \(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs, 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, 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, On shortest three-edge-connected Steiner networks with Euclidean distance, Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint, 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, New edges not used in shortest tours of TSP, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, Solving the 2-rooted mini-max spanning forest problem by branch-and-bound, Heuristic procedure neural networks for the CMST problem, Planar bichromatic minimum spanning trees, Opportune moment strategies for a cost spanning tree game, An evolutionary approach for finding optimal trees in undirected networks, 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, A neural network for the Steiner minimal tree problem, Generalized Steiner problem in outerplanar networks, A New Similarity Measure and Its Use in Determining the Number of Clusters in a Multivariate Data Set, A hybrid method for improved critical points for multiple comparisons, The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games, Rank Correlation Coefficient Correction by Removing Worst Cases, Greedy Families for Linear Objective Functions, Unnamed Item, Path Optimality Conditions for Minimum Spanning Tree Problem with Uncertain Edge Weights, The 1-Steiner-Minimal-Tree problem in Minkowski-spaces, Dynamic Shapley Value for Two-Stage Cost Sharing Game, A survey on combinatorial optimization in dynamic environments, An optimal algorithm for rectilinear steiner trees for channels with obstacles, Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR, Edge erasures and chordal graphs, Unnamed Item, Ultrametric Watersheds, COUPLED NETWORK APPROACH TO PREDICTABILITY OF FINANCIAL MARKET RETURNS AND NEWS SENTIMENTS, A CLASS OF GROWTH MODELS RESCALING TO KPZ, Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems, The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources, A NEW GRAPHICAL APPROACH TO CLASSIFY SPATIAL POINT PATTERNS BASED ON HIERARCHICAL CLUSTER ANALYSIS, Minimum Cuts and Sparsification in Hypergraphs, INTUITIONISTIC FUZZY DENSITY-BASED AGGREGATION OPERATORS AND THEIR APPLICATIONS TO GROUP DECISION MAKING WITH INTUITIONISTIC PREFERENCE RELATIONS, Unnamed Item, Estimating finite mixture of continuous trees using penalized mutual information, Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization, Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem, A Moderately Exponential Time Algorithm for Full Degree Spanning Tree, An exact method to generate all nondominated spanning trees, Lipschitz-free Spaces on Finite Metric Spaces, The Minimum Spanning Tree Problem with Time Window Constraints, OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS, Unnamed Item, A Fractal Dimension for Measures via Persistent Homology, A greedy algorithm for solving a certain class of linear programmes, Inference and Learning in Multi-dimensional Bayesian Network Classifiers, Constructing near spanning trees with few local inspections, Unnamed Item, Geometry and topology of local minimal 2-trees, The computation of factorization invariants for affine semigroups, Scheduling parallel conference sessions: an application of a novel hybrid clustering algorithm for ensuring constrained cardinality, Computing capacitated minimal spanning trees efficiently, Quadratic Combinatorial Optimization Using Separable Underestimators, HOW TO SYNCHRONIZE THE ACTIVITY OF ALL COMPONENTS OF A P SYSTEM?, Incomplete graphical model inference via latent tree aggregation, An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information, An efficient algorithm for minimumk-covers in weighted graphs, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs., Application of a generalized Sherman–Morrison formula to the computation of network Green's functions and the construction of spanning trees, Fast Constrained Image Segmentation Using Optimal Spanning Trees, A general system for heuristic minimization of convex functions over non-convex sets, Spanning-Tree Games., Unsupervised training of Bayesian networks for data clustering, Adaptive Evolutionary Algorithm Based on a Cliqued Gibbs Sampling over Graphical Markov Model Structure, Some theoretical implications of local optimization, Generalized constructive tree weights, Random minimal directed spanning trees and Dickman-type distributions, Algorithms to solve the knapsack constrained maximum spanning tree problem, Steiner Minimal Tree for Points on a Circle, Unnamed Item, The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization, A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs, Fast Synchronization in P Systems, Critical random graphs and the structure of a minimum spanning tree, The traveling salesman problem: A duality approach, Algorithms for Euclidean Degree Bounded Spanning Tree Problems, Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence, Noncooperative cost spanning tree games with budget restrictions, Approximate stable solutions in infinite tree problems, The Held—Karp algorithm and degree-constrained minimum 1-trees, Distances between Factorizations in the Chicken McNugget Monoid, Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem, Unnamed Item, A template-based adaptive large neighborhood search for the consistent vehicle routing problem, The tensor track, III, An Event-Driven Algorithm for Agents on the Web, Fuzzy α-minimum spanning tree problem: definition and solutions, Parametric controllability of the personalized PageRank: Classic model vs biplex approach, Use of matroid theory in operations research, circuits and systems theory, Design and Engineering of External Memory Traversal Algorithms for General Graphs, The representations of nested composition algebras, Growing spanning trees in plasmodium machines, Distances in multimedia phylogeny, Linear-time algorithms for parametric minimum spanning tree problems on planar graphs, Graphs and Algorithms in Communication Networks on Seven League Boots, Lens data depth and median, An Adaptive Minimum Spanning Tree Multielement Method for Uncertainty Quantification of Smooth and Discontinuous Responses, Classification of Coupled Dynamical Systems with Multiple Delays: Finding the Minimal Number of Delays, COST SHARING IN NETWORKS: SOME OPEN QUESTIONS, CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS, Synthesis of single-product networks, Regression Methods for Combining Multiple Classifiers, OVERALL DESIGN OF RELIABLE CENTRALIZED VOICE/DATA COMMUNICATION NETWORK, The computation of nearly minimal Steiner trees in graphs, THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context, On recursive computation of minimum spanning trees for special partial graphs, Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem, Meaningful and Meaningless Statements in Landscape Ecology and Environmental Sustainability, Discrete Bayesian Network Classifiers, Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree, Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen, A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges, Some problems in discrete optimization, The traveling-salesman problem and minimum spanning trees: Part II, Polynomial-time algorithms for multimarginal optimal transport problems with structure, Interacting loop ensembles and Bose gases, Average Sensitivity of Graph Algorithms, Factors affecting the final solution of the bike-sharing rebalancing problem under heuristic algorithms, On the complexity of the cable-trench problem, On the revealed preference analysis of stable aggregate matchings, On the complexity of the bilevel minimum spanning tree problem, Re‐identification in the Absence of Common Variables for Matching, An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search, Successive minimum spanning trees, Tropical Monte Carlo quadrature for Feynman integrals, A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem, How to generate perfect mazes?, On conflict-free spanning tree: algorithms and complexity, A graph-based decomposition method for convex quadratic optimization with indicators, Algorithms for computing the folk rule in minimum cost spanning tree problems with groups, The vehicle routing problem with time windows and flexible delivery locations, A branch-and-bound approach for a vehicle routing problem with customer costs, An egalitarian solution to minimum cost spanning tree problems, Algorithm for sequential construction of spanning minimal directed forests, An efficient mixed integer linear programming model for the minimum spanning tree problem, Unnamed Item, On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage: A branch‐and‐cut algorithm, An oracle-based framework for robust combinatorial optimization, Multisource invasion percolation on the complete graph, Models of random subtrees of a graph, Topology reconstruction using time series data in telecommunication networks, On a wider class of prior distributions for graphical models, Matroids and the greedy algorithm, Unnamed Item, On the spanning trees of weighted graphs, A faster approximation algorithm for the Steiner problem in graphs, Globally and locally minimal weight spanning tree networks, Minimum-weight spanning tree algorithms. A survey and empirical study, Topological optimization with a network reliability constraint, Development of group setup strategies for makespan minimisation in PCB assembly, Learning from imprecise data: possibilistic graphical models., The cable trench problem: Combining the shortest path and minimum spanning tree problems, Sequences of spanning trees and a fixed tree theorem, Planar lattices do not recover from forest fires, Sparse nonparametric graphical models, Online Minimum Spanning Tree with Advice, Advances in Constrained Connectivity, Hierarchies in communities of UK stock market from the perspective of Brexit, NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3