Local Search: Is Brute-Force Avoidable?

First Page		Document Content
Date: 2009-06-22 08:17:00 Planar graphs NP-complete problems Tree decomposition Minor Apex graph Graph Clique-sum Neighbourhood Vertex cover Graph theory Theoretical computer science Graph operations		Local Search: Is Brute-Force Avoidable? Add to Reading List Source URL: ijcai.org Download Document from Source Website File Size: 494,64 KB Share Document on Facebook

	Proof, beliefs, and algorithms through the lens of sum-of-squares 1 An integrality gap for the planted clique problem The Planted Clique problem (sometimes referred to as the hidden clique DocID: 1sYyH - View Document
	JMLR: Workshop and Conference Proceedings vol 40:1–40, 2015 28th Annual Conference on Learning Theory Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems DocID: 1pbWy - View Document
	Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Yash Deshpande∗ and Andrea Montanari† February 28, 2015 Abstract DocID: 1mCri - View Document
	On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada DocID: 18iEc - View Document
	ELSEVIER Information Processing Letters DocID: 18cl1 - View Document