The \(k\)-path tree matroid and its applications to survivable network design

DOI10.1016/j.disopt.2006.11.009zbMath1177.90049OpenAlexW2089655957MaRDI QIDQ951105

Esther M. Arkin, Refael Hassin

Publication date: 29 October 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2006.11.009

zbMATH Keywords

algorithmmatroid intersectionnetwork connectivity

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the point-to-point connection problem
• A factor 2 approximation algorithm for the generalized Steiner network problem
• A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
• The directed subgraph homeomorphism problem
• The point-to-point delivery and connection problems: Complexity and algorithms
• The point-to-point connection problem - analysis and algorithms
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A note on relatives to the Held and Karp 1-tree problem
• Designing Hierarchical Survivable Networks
• Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
• Connectivity-splitting models for survivable network design
• Algorithms for a network design problem with crossing supermodular demands
• Design of Survivable Networks: A survey
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems