A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
From MaRDI portal
Recommendations
Cited in
(41)- Sparsity-certifying graph decompositions
- Forests, frames, and games: Algorithms for matroid sums and applications
- An algorithm for min-cost edge-disjoint cycles and its applications
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- The parity Hamiltonian cycle problem
- Edge-disjoint spanning trees and the number of maximum state circles of a graph
- Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs
- Approximating minimum-cost graph problems with spanning tree edges
- Edge-colored graphs with applications to homogeneous faults
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Game edge-connectivity of graphs
- On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights
- The generalized 3-connectivity of two kinds of regular networks
- Sensitivity analysis for symmetric 2-peripatetic salesman problems
- Pebble game algorithms and sparse graphs
- Note on the spanning-tree packing number of lexicographic product graphs
- Network reinforcement
- Balancing connected colourings of graphs
- On edge-disjoint spanning trees with small depths
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- Finding totally independent spanning trees with linear integer programming
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Edge Partition of Toroidal Graphs into Forests in Linear Time
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Decomposing the hypercube Q_n into n isomorphic edge-disjoint trees
- Bounds for the symmetric 2-peripatetic salesman problem
- Completely independent spanning trees in torus networks
- The edge-disjoing steiner problem in graphs
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- The generalized 4-connectivity of hypercubes
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
- Fully dynamic arboricity maintenance
- Relay placement for fault tolerance in wireless networks in higher dimensions
- Lower and upper bounds for the m-peripatetic vehicle routing problem
- Fast algorithms via dynamic-oracle matroids
- Edge-disjoint spanning trees of arbitrary bounded diameter on random inputs
- Properties of Euclidean minimum weight (k, )-tight graphs
- On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms
This page was built for publication: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705239)
