The Minimum Weight In-Tree Cover Problem

DOI10.1007/978-3-540-87477-5_17zbMath1160.90677OpenAlexW1516318098MaRDI QIDQ3627688

Naoyuki Kamiyama, Naoki Katoh

Publication date: 13 May 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_17

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forests, frames, and games: Algorithms for matroid sums and applications
• Covering the edge set of a directed graph with trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A matroid approach to finding edge connectivity and packing arborescences
• Maximal Flow Through a Network
• Covering Directed Graphs by In-Trees
• Algorithms for Graphic Polymatroids and Parametrics-Sets

This page was built for publication: The Minimum Weight In-Tree Cover Problem