scientific article; zbMATH DE number 3373559
From MaRDI portal
Publication:5645231
zbMath0235.90056MaRDI QIDQ5645231
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs ⋮ Dispersal routes reconstruction and the minimum cost arborescence problem ⋮ Exact arborescences, matchings and cycles ⋮ Approximating the Spanning k-Tree Forest Problem ⋮ A simple algorithm and min-max formula for the inverse arborescence problem ⋮ Robustness of minimum cost arborescences ⋮ Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ The b‐bibranching problem: TDI system, packing, and discrete convexity ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ The \(b\)-branching problem in digraphs ⋮ Precedence-constrained arborescences ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On finding optimal polytrees ⋮ An LP-based heuristic algorithm for the node capacitated in-tree packing problem ⋮ The weighted arborescence constraint ⋮ Approximating optimum branchings in linear time ⋮ Counting minimum weight arborescences ⋮ Distances in multimedia phylogeny ⋮ Hybrid fiber co-axial CATV network design with variable capacity optical network units ⋮ Approximate minimum directed spanning trees under congestion ⋮ A multiperiod min-sum arborescence problem
This page was built for publication:
