CS364B: Frontiers in Mechanism Design Lecture - Randomized rounding - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-06-11 16:25:54 Mathematics Operations research Linear programming Combinatorial optimization Convex optimization Submodular set function Valuation Approximation algorithm Randomized rounding Ellipsoid method Mathematical optimization Algorithm		CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014 Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 172,47 KB Share Document on Facebook

	Advanced Approximation Algorithms (CMU 18-854B, SpringLecture 2: LP Relaxations, Randomized Rounding Jan 17, 2008 DocID: 1tp7O - View Document
	Iterative Randomized Rounding Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011 Joint work with Jaroslaw Byrka, DocID: 1skvJ - View Document
	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 DocID: 1r9bi - View Document
	The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. Carg`ese 2011 DocID: 1r2GX - View Document
	Unifying Local Consistency and MAX SAT Relaxations for Scalable Inference with Rounding Guarantees Stephen H. Bach University of Maryland DocID: 1r1cx - View Document