A Subexponential Algorithm for Abstract Optimization Problems Bernd G¨artner

First Page		Document Content
Date: 2003-08-08 05:46:59 Operations research Computational complexity theory Linear programming Convex optimization Analysis of algorithms LP-type problem XTR Ellipsoid method Randomized algorithm Theoretical computer science Applied mathematics Mathematics		A Subexponential Algorithm for Abstract Optimization Problems Bernd G¨artner Add to Reading List Source URL: www.inf.ethz.ch Download Document from Source Website File Size: 239,91 KB Share Document on Facebook

	The Ellipsoid Method: A Survey DocID: 1rsIC - View Document
	CS168: The Modern Algorithmic Toolbox Lecture #18: Linear and Convex Programming, with Applications to Sparse Recovery Tim Roughgarden & Gregory Valiant∗ May 25, 2016 DocID: 1rjsj - 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
	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ DocID: 1qR3A - View Document
	Simple and Fast Inverse Alignment John Kececioglu and Eagu Kim Department of Computer Science, The University of Arizona, Tucson, AZ 85721, USA {kece, egkim}@cs.arizona.edu DocID: 1qOVn - View Document