scientific article; zbMATH DE number 3512137

MaRDI QIDQ4091971zbMATH OpenFDO

Authors Michel Lorea

Publication date 1975

Mathematics Subject Classification ID

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

Cited in

(12)

• Strong algorithms for the ordinal matroid secretary problem
• 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
• Sparse hypergraphs and pebble game algorithms
• Steiner connectivity problems in hypergraphs
• Packing of mixed hyperarborescences with flexible roots via matroid intersection
• Reachability in arborescence packings
• A Survey on Covering Supermodular Functions
• Computing minimum multiway cuts in hypergraphs

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)