Closure in Independence Systems

DOI10.1287/MOOR.7.2.159MaRDI QIDQ3964324zbMATH OpenOpenAlexFDO

Authors Laurence R. Matthews

Publication date 1982

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.7.2.159

zbMATH Keywords

acyclic subgraphclosure operatorscombinatorial optimizationdualitygreedy algorithmindependence systemmatroidpaintingstravelling salesman

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Integer programming (90C10)

Cited in

(5)

• Minimum partition of an independence system into independent sets
• Rank-axiomatic characterizations of independence systems
• In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
• On the greedy algorithm with random costs
• Modulus for bases of matroids

This page was built for publication: Closure in Independence Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964324)