The Minimum Weight In-Tree Cover Problem

DOI10.1007/978-3-540-87477-5_17MaRDI QIDQ3627688zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Covering Directed Graphs by In-Trees
• Covering directed graphs by in-trees
• Approximation algorithm for the minimum directed tree cover
• Directed Steiner problems with connectivity constraints

Cites work

• A matroid approach to finding edge connectivity and packing arborescences
• Algorithms for Graphic Polymatroids and Parametrics-Sets
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Covering Directed Graphs by In-Trees
• Covering the edge set of a directed graph with trees
• Forests, frames, and games: Algorithms for matroid sums and applications
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3659627 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• Maximal Flow Through a Network

Cited in

(4)

• Structure of minimum-weight directed forests: related forests and convexity inequalities
• Covering Directed Graphs by In-Trees
• Covering directed graphs by in-trees
• The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths

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

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