Minimum Covers of Fixed Cardinality in Weighted Graphs

DOI10.1137/0121014MaRDI QIDQ5621380zbMATH OpenOpenAlexFDO

Authors Lee J. White

Publication date 1971

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0121014

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cited in

(9)

• Fuzzy minimum weight edge covering problem
• Forest covers and a polyhedral intersection theorem
• A linear algorithm to determine minimal spanning forests in chain graphs
• Matroids and a forest cover problem
• System of unbiased representatives for a collection of bicolorings
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Edge covering problem under hybrid uncertain environments
• An efficient algorithm for minimumk-covers in weighted graphs
• An o(n n)-time approximation scheme for geometric many-to-many matching

This page was built for publication: Minimum Covers of Fixed Cardinality in Weighted Graphs

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