CS 598CSC: Approximation Algorithms Instructor: Chandra Chekuri

First Page		Document Content
Date: 2009-02-06 16:43:24 Operations research NP-complete problems Combinatorial optimization Dynamic programming Knapsack problem Bin packing problem Polynomial-time approximation scheme Approximation algorithm Linear programming relaxation Theoretical computer science Computational complexity theory Applied mathematics		CS 598CSC: Approximation Algorithms Instructor: Chandra Chekuri Add to Reading List Source URL: courses.engr.illinois.edu Download Document from Source Website File Size: 112,61 KB Share Document on Facebook

	Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1 DocID: 1rlHb - View Document
	Rounding Guarantees for Message-Passing MAP Inference with Logical Dependencies Stephen H. Bach Computer Science Dept. University of Maryland DocID: 1rhNI - 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
	PRACTICAL EXPERIENCE WITH A MAP LABEL PLACEMENT PROGRAM Steven Zoraster Stephen Bayer ZYCOR, Inc. 220 Foremost Austin, Texas 78745 DocID: 1qZeR - View Document
	CS261: Exercise Set #5 For the week of February 1–5, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza. DocID: 1qXY7 - View Document