scientific article; zbMATH DE number 3512137
From MaRDI portal
Publication:4091971
zbMath0327.05036MaRDI QIDQ4091971
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Packing Steiner trees ⋮ Reachability in arborescence packings ⋮ Steiner connectivity problems in hypergraphs ⋮ On decomposing a hypergraph into \(k\) connected sub-hypergraphs ⋮ A Survey on Covering Supermodular Functions ⋮ Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs ⋮ Blocking optimal arborescences ⋮ On Turan hypergraphs ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Packing of mixed hyperarborescences with flexible roots via matroid intersection ⋮ Sparse hypergraphs and pebble game algorithms ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ On some algorithmic aspects of hypergraphic matroids
This page was built for publication:
