scientific article; zbMATH DE number 3512137

zbMATH Open0327.05036MaRDI QIDQ4091971FDOQ4091971

Michel Lorea

Publication date: 1975

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Cited In (13)

• Packing Steiner trees
• On Turan hypergraphs
• On some algorithmic aspects of hypergraphic matroids
• 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
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• Steiner connectivity problems in hypergraphs
• Sparse hypergraphs and pebble game algorithms
• Packing of mixed hyperarborescences with flexible roots via matroid intersection
• Reachability in arborescence packings
• A Survey on Covering Supermodular Functions
• Strong Algorithms for the Ordinal Matroid Secretary Problem
• Computing minimum multiway cuts in hypergraphs
• Blocking optimal arborescences

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