scientific article; zbMATH DE number 3373559
From MaRDI portal
Publication:5645231
zbMATH Open0235.90056MaRDI QIDQ5645231FDOQ5645231
Authors: Frederick Bock
Publication date: 1971
Title of this publication is not available (Why is that?)
Cited In (23)
- A multiperiod min-sum arborescence problem
- Approximating the Spanning k-Tree Forest Problem
- Approximate minimum directed spanning trees under congestion
- Exact arborescences, matchings and cycles
- The weighted arborescence constraint
- A simple algorithm and min-max formula for the inverse arborescence problem
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
- The \(b\)-branching problem in digraphs
- Robustness of minimum cost arborescences
- Dispersal routes reconstruction and the minimum cost arborescence problem
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem
- Hybrid fiber co-axial CATV network design with variable capacity optical network units
- The b‐bibranching problem: TDI system, packing, and discrete convexity
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Precedence-constrained arborescences
- Distances in multimedia phylogeny
- Counting minimum weight arborescences
- Title not available (Why is that?)
- Approximating optimum branchings in linear time
- A distributed algorithm for directed minimum-weight spanning tree
- On finding optimal polytrees
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5645231)