Pages that link to "Item:Q3705239"

The following pages link to A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees (Q3705239):

Displaying 38 items.

• On edge-disjoint spanning trees with small depths (Q294801) (← links)
• Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
• Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
• Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
• Decomposing the hypercube \(Q_n\) into \(n\) isomorphic edge-disjoint trees (Q418894) (← links)
• Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph (Q492279) (← links)
• The generalized 4-connectivity of hypercubes (Q507578) (← links)
• Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
• Sparsity-certifying graph decompositions (Q1043807) (← links)
• Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
• An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787) (← links)
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
• The parity Hamiltonian cycle problem (Q1690220) (← links)
• Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
• Subgraphs decomposable into two trees and \(k\)-edge-connected subgraphs (Q1861573) (← links)
• Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
• Edge-colored graphs with applications to homogeneous faults (Q1944099) (← links)
• Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
• Game edge-connectivity of graphs (Q2028096) (← links)
• 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 (Q2117617) (← links)
• The generalized 3-connectivity of two kinds of regular networks (Q2238216) (← links)
• Sensitivity analysis for symmetric 2-peripatetic salesman problems (Q2367396) (← links)
• Pebble game algorithms and sparse graphs (Q2476285) (← links)
• Note on the spanning-tree packing number of lexicographic product graphs (Q2514151) (← links)
• Network reinforcement (Q2583121) (← links)
• Balancing connected colourings of graphs (Q2699645) (← links)
• Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
• Edge Partition of Toroidal Graphs into Forests in Linear Time (Q3439375) (← links)
• Determining a Minimum Spanning Tree with Disjunctive Constraints (Q3645334) (← links)
• Bounds for the symmetric 2-peripatetic salesman problem (Q4327897) (← links)
• Completely independent spanning trees in torus networks (Q4648692) (← links)
• The edge-disjoing steiner problem in graphs (Q4893707) (← links)
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431) (← links)
• A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem (Q5443376) (← links)
• Fully dynamic arboricity maintenance (Q5918831) (← links)
• On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)