The \(k\)-path tree matroid and its applications to survivable network design
type: Item
instance of: scholarly article
title: The \(k\)-path tree matroid and its applications to survivable network design
zbMATH Open document ID: 1177.90049
author: Esther M. Arkin
author: Refael Hassin
published in: Discrete Optimization
publication date: 2008-10-29T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 5358792
zbMATH Keywords: network connectivity
zbMATH Keywords: algorithm
zbMATH Keywords: matroid intersection
MaRDI profile type: Publication
full work available at URL: j.disopt.2006.11.009
OpenAlex ID: W2089655957
cites work: Q3056948
cites work: Designing hierarchical survivable networks
cites work: Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
cites work: Connectivity-splitting models for survivable network design
cites work: A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
cites work: The directed subgraph homeomorphism problem
cites work: Q3859792
cites work: Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
cites work: Q4178800
cites work: Q4845372
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Design of Survivable Networks: A survey
cites work: A factor 2 approximation algorithm for the generalized Steiner network problem
cites work: Q3048571
cites work: The point-to-point delivery and connection problems: Complexity and algorithms
cites work: Algorithms for a network design problem with crossing supermodular demands
cites work: Q5582910
cites work: On the point-to-point connection problem
cites work: The point-to-point connection problem - analysis and algorithms
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A note on relatives to the Held and Karp 1-tree problem
DOI: 10.1016/J.DISOPT.2006.11.009
description: scientific article; zbMATH DE number 5358792