Finding Totally Independent Spanning Trees with Linear Integer Programming
From MaRDI portal
Publication:3195324
DOI10.1007/978-3-319-09174-7_13zbMath1452.90277OpenAlexW183031105MaRDI QIDQ3195324
No author found.
Publication date: 16 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_13
combinatorial optimizationbranch-and-cut algorithmspacking connected dominating setstotally independent spanning trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent spanning trees of chordal rings
- Two counterexamples on completely independent spanning trees
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
- The multi-tree approach to reliability in distributed networks
- Design of survivable networks
- Minimal spanning trees with a constraint on the number of leaves
- Approximation algorithms for connected dominating sets
- An exact algorithm for the maximum leaf spanning tree problem.
- On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
- Distributed connectivity decomposition
- The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
- Edge-Disjoint Spanning Trees of Finite Graphs
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Steiner problem in networks: A survey
- The maximum-leaf spanning tree problem: Formulations and facets
- Completely independent spanning trees in torus networks
- Design of Survivable Networks: A survey
- Finding minimum congestion spanning trees
- Completely independent spanning trees in the underlying graph of a line digraph
- Independent spanning trees with small depths in iterated line digraphs
