Revisiting the Set Cover Conjecture.

Robert Krauthgamer, Ohad Trabelsi

Type: Article

Publication Date: 2017-11-21

Citations: 0

Similar Works

Action	Title	Year	Authors
+	Note on the Union-Closed Sets Conjecture.	1998	Weidong Gao Hongquan Yu
+	The journey of the union-closed sets conjecture	2013	Henning Bruhn Oliver Schaudt
+	The journey of the union-closed sets conjecture	2013	Henning Bruhn Oliver Schaudt
+ PDF Chat	The Journey of the Union-Closed Sets Conjecture	2015	Henning Bruhn Oliver Schaudt
+	A proof of Sethares? conjecture	2004	Guowu Yao
+	The Flat Cover Conjecture and Its Solution	2001	Edgar E. Enochs Overtoun M. G. Jenda
+ PDF Chat	Greedy Set-Cover Algorithms	2014	Neal E. Young
+ PDF Chat	Greedy Set-Cover Algorithms	2016	Neal E. Young
+ PDF Chat	Greedy Set-Cover Algorithms	2008	Neal E. Young
+	The class-breadth conjecture revisited	2006	Bettina Eick M. F. Newman E. A. O’Brien
+	Proof of Union- Closed Sets Conjecture	2015	Vladimir Blinovsky
+	The Blumenthal Conjecture	2013	W. Hayman T. Tyler D. White
+	A Tight Analysis of the Greedy Algorithm for Set Cover	1997	Petr Slavı́k
+	On a Bound of Cover-Free Families	2004	Xiao Ma Ruizhong Wei
+	Counting Set Covers and Split Graphs	2000	Gordon Royle
+	The Union-Closed sets conjecture and Hamming metric	2021	Charif Harrafa
+	A set coverage problem	2009	Guo‐Qiang Zhang Licong Cui
+	A Note on Small Cover and Halperin-Carlsson Conjecture	2010	Yu Li
+	On the Union-Closed Set Conjecture	2016	Sven Schäge
+	Cardinality bounds via covers by compact sets	2020	Angelo Bella Nathan Carlson

Action	Title	Year	Authors

Action	Title	Year	Authors
+	Partitioning into Sets of Bounded Cardinality	2009	Mikko Koivisto
+ PDF Chat	Set Partitioning via Inclusion-Exclusion	2009	Andreas Björklund Thore Husfeldt Mikko Koivisto
+ PDF Chat	On Problems as Hard as CNF-SAT	2012	Marek Cygan Holger Dell Daniel Lokshtanov D'niel Marx Jesper Nederlof Yoshio Okamoto Ramamohan Paturi Saket Saurabh Magnus Wahlström
+ PDF Chat	Determinant Sums for Undirected Hamiltonicity	2010	Andreas Björklund
+	Finding large set covers faster via the representation method	2016	Jesper Nederlof
+ PDF Chat	On the Equivalence among Problems of Bounded Width	2015	Yoichi Iwata Yuichi Yoshida