Two Algorithms for Generating Weighted Spanning Trees in Order
From MaRDI portal
Publication:4116059
DOI10.1137/0206011zbMath0346.68021OpenAlexW2091507391WikidataQ56077948 ScholiaQ56077948MaRDI QIDQ4116059
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ddfd71c0873183c06bf9ce78bc8ed3a465fba44c
Related Items
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach, Parsimonious parameterization of correlation matrices using truncated vines and factor analysis, On spanning tree problems with multiple objectives, Finding the k smallest spanning trees, Fair cost-sharing methods for the minimum spanning tree game, Faster enumeration of all spanning trees of a directed graph, A decision-theoretic approach to robust optimization in multivalued graphs, A note on \(K\) best network flows, Computing all efficient solutions of the biobjective minimum spanning tree problem, An algorithm for \(k^{\text{th}}\) minimum spanning tree, Combinatorial algorithms for DNA sequence assembly, The Kth TSP is pseudopolynomial when TSP is polynomial, On bicriterion minimal spanning trees: An approximation, Weighting factor extensions for finite multiple objective vector minimization problems, A new approach for the multiobjective minimum spanning tree, Minimum spanning trees in networks with varying edge weights, On the bicriterion - minimal cost/minimal label - spanning tree problem, Choquet-based optimisation in multiobjective shortest path and spanning tree problems, k-optimal solution sets for some polynomially solvable scheduling problems, Enumerating \(K\) best paths in length order in DAGs, Two‐phase strategies for the bi‐objective minimum spanning tree problem, Ranking arborescences in O(Km log n) time, Obtaining approximately optimal and diverse solutions via dispersion, An efficient time and space \(K\) point-to-point shortest simple paths algorithm, Designing a minimal spanning tree network subject to a budget constraint, Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search, Finding the \(k\) smallest spanning trees, Multicriteria path and tree problems: discussion on exact algorithms and applications, Enumerating the \(k\) best plane spanning trees, Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization, A branch and bound algorithm for the robust spanning tree problem with interval data, The Min-Max Spanning Tree Problem and some extensions, Unnamed Item, A Survey on Multiple Objective Minimum Spanning Tree Problems, Combinatorial optimization in system configuration design, On the \(K\) shortest path trees problem, An O(K.n**4) algorithm for finding the K best cuts in a network, Adjacency on combinatorial polyhedra, Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions, A lower bound on solutions of Chartrand's problem, Truncation of vine copulas using fit indices, A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs, Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph, Optimal vertex ordering of graphs
