The Steiner Problem for Count Matroids

DOI10.1007/978-3-030-48966-3_25MaRDI QIDQ5041203zbMATH OpenOpenAlexFDO

Authors Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino, Tibor Jordán

Publication date 13 October 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-48966-3_25

zbMATH Keywords

count matroidrigid graphSteiner problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• About count matroids
• Counting Problems Associated With Steiner Trees In Graphs
• The Steiner tree problem
• scientific article; zbMATH DE number 26676
• k-Steiner-minimal-trees in metric spaces

Cites work

• Algorithms for graph rigidity and scene analysis
• An improved LP-based approximation for Steiner tree
• Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
• Connections in combinatorial optimization
• Constructive characterizations for packing and covering with trees
• Decomposition of Finite Graphs Into Forests
• Geometric sensitivity of rigid graphs
• scientific article; zbMATH DE number 3912403 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• On graphs and rigidity of plane skeletal structures
• On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
• Pebble game algorithms and sparse graphs
• Steiner tree problems in computer communication networks.
• The Steiner Problem for Count Matroids

Cited in

(3)

• Steiner complexes, matroid ports, and shellability
• Steenrod problem and the domination relation
• The Steiner Problem for Count Matroids

Describes a project that uses

Uses Software

• EGRES

This page was built for publication: The Steiner Problem for Count Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041203)