On minimally non-firm binary matrices

DOI10.1007/978-3-031-18530-4_6zbMath1528.90222arXiv2206.04089OpenAlexW4313116916MaRDI QIDQ6166892

Réka Ágnes Kovács

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.04089

zbMATH Keywords

Boolean rankrectangle covering numberfirm matrices

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimax theorem on intervals
• The strong perfect graph theorem
• A notion of cross-perfect bipartite graphs
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Alternating cycle-free matchings
• Algorithmic graph theory and perfect graphs
• On edge perfectness and classes of bipartite graphs
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
• Doubly Lexical Orderings of Matrices
• A Combinatorial Decomposition Theory
• Communication Complexity

This page was built for publication: On minimally non-firm binary matrices