The minimum cut cover problem

DOI10.1016/J.ENDM.2011.05.044MaRDI QIDQ2840718zbMATH OpenOpenAlexFDO

Authors Edna A. Hoshino

Publication date 23 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2011.05.044

zbMATH Keywords

branch-and-priceheuristicinteger programmingminimum cut cover

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• Minimal cut cover of a graph with an application to the testing of electronic boards
• The vertex \(k\)-cut problem
• On fractional cut covers
• A note on the minimum cut cover of graphs
• A Polynomial Algorithm for the k-cut Problem for Fixed k

Cites work

• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1875415 (Why is no real title available?)
• Minimal cut cover of a graph with an application to the testing of electronic boards

Cited in

(7)

• The minimum likely column cover problem
• Minimal cut cover of a graph with an application to the testing of electronic boards
• A note on the minimum cut cover of graphs
• On fractional cut covers
• Identifying defective network components through restricted group testing
• scientific article; zbMATH DE number 5936584 (Why is no real title available?)
• Minimum scan cover with angular transition costs

This page was built for publication: The minimum cut cover problem

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