The Steiner Problem for Count Matroids

DOI10.1007/978-3-030-48966-3_25OpenAlexW3029801102MaRDI QIDQ5041203

Kazuhisa Makino, Ryoga Mahara, Yusuke Kobayashi, 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

Steiner problemcount matroidrigid graph

Mathematics Subject Classification ID

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

Related Items

The Steiner Problem for Count Matroids

Uses Software

• EGRES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive characterizations for packing and covering with trees
• On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
• Pebble game algorithms and sparse graphs
• On graphs and rigidity of plane skeletal structures
• An improved LP-based approximation for steiner tree
• The Steiner Problem for Count Matroids
• Geometric Sensitivity of Rigid Graphs
• Decomposition of Finite Graphs Into Forests
• Algorithms - ESA 2003