Skip to main content
Conference Proceedings

Identically Self-blocking Clutters

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11480 LNCS 1-12
DOI: 10.1007/978-3-030-17953-3_1
4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A clutter is identically self-blocking if it is equal to its blocker. We prove that every identically self-blocking clutter different from is nonideal. Our proofs borrow tools from Gauge Duality and Quadratic Programming. Along the way we provide a new lower bound for the packing number of an arbitrary clutter.

Cite

CITATION STYLE

APA

Abdi, A., Cornuéjols, G., & Lee, D. (2019). Identically Self-blocking Clutters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11480 LNCS, pp. 1–12). Springer Verlag. https://doi.org/10.1007/978-3-030-17953-3_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free