Spanning Trees and Optimization Problems
From MaRDI portal
Publication:4443626
DOI10.1201/9780203497289zbMath1072.90047OpenAlexW4302604684MaRDI QIDQ4443626
Publication date: 18 January 2004
Full work available at URL: https://doi.org/10.1201/9780203497289
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On the minimum routing cost clustered tree problem ⋮ On the uniform edge-partition of a tree ⋮ Geometry of the smallest 1-form Laplacian eigenvalue on hyperbolic manifolds ⋮ Scatter search for the minimum leaf spanning tree problem ⋮ A new approach for the multiobjective minimum spanning tree ⋮ On the intercluster distance of a tree metric ⋮ Proof of a conjecture about minimum spanning tree cycle intersection ⋮ A tight bound on the min-ratio edge-partitioning problem of a tree ⋮ A tutorial on the balanced minimum evolution problem ⋮ The Michaelis-Menten-Stueckelberg theorem ⋮ General variable neighborhood search for the minimum stretch spanning tree problem ⋮ The backup 2-median problem on block graphs ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Nonstandard \(n\)-distances based on certain geometric constructions ⋮ A linear-time algorithm for finding an edge-partition with max-min ratio at most two ⋮ COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS ⋮ Average distance in weighted graphs ⋮ Bounded-degree light approximate shortest-path trees in doubling metrics ⋮ Existence of a spanning tree having small diameter ⋮ Spanning trees with small diameters ⋮ Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ The 2-radius and 2-radiian problems on trees ⋮ The swap edges of a multiple-sources routing tree ⋮ Minimum congestion spanning trees in planar graphs ⋮ The minimum cost shortest-path tree game ⋮ The backup 2‐center and backup 2‐median problems on trees ⋮ Finding multi-objective supported efficient spanning trees ⋮ A MILP-based VND for the min-max regret shortest path tree problem with interval costs ⋮ Evolutionary design of oriented-tree networks using Cayley-type encodings ⋮ Degree bounded bottleneck spanning trees in three dimensions ⋮ Combinatorial optimization in system configuration design ⋮ A non-cooperative game theory approach to cost sharing in networks ⋮ Approximating the maximum internal spanning tree problem ⋮ Opportune moment strategies for a cost spanning tree game ⋮ Counting spanning trees in self-similar networks by evaluating determinants ⋮ Approximation algorithms for solving the line-capacitated minimum Steiner tree problem ⋮ Emerging spanning trees in the work of Candilis-Josic-Woods ⋮ On the Clustered Steiner Tree Problem ⋮ Design and dimensioning of hydrogen transmission pipeline networks ⋮ On the clustered Steiner tree problem ⋮ A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem ⋮ Improved similarity measure in neutrosophic environment and its application in finding minimum spanning tree
