Optimization over Integers with Robustness in Cost and Few Constraints Kai-Simon Goetzmann1? , Sebastian Stiller2?? , and Claudio Telha3 1 [removed], Institut f¨

First Page		Document Content
Date: 2011-11-07 10:30:48 Operations research Mathematical optimization Convex optimization Computational complexity theory Approximation algorithms Unimodular matrix Linear programming Optimization problem Robust optimization Theoretical computer science Applied mathematics Mathematics		Optimization over Integers with Robustness in Cost and Few Constraints Kai-Simon Goetzmann1? , Sebastian Stiller2?? , and Claudio Telha3 1 [removed], Institut f¨ Add to Reading List Source URL: www.coga.tu-berlin.de Download Document from Source Website File Size: 283,20 KB Share Document on Facebook

	Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling Ioannis Caragiannis1 , Vasilis Gkatzelis2 , and Cosimo Vinci3 1 University of Patras, Rion-Patras, Greece DocID: 1xTKO - View Document
	Approximation algorithms An algorithm has approximation ratio r if it outputs solutions with cost such that c/c* ≤ r and c/c ≤ r where c is the optimal cost. DocID: 1vcdB - View Document
	Greedy approximation algorithms for dire ted multi uts Yana Kortsarts Guy Kortsarz Widener University DocID: 1uQsZ - View Document
	Fixed-Parameter and Approximation Algorithms: A New Look Rajesh Chitnis ∗ MohammadTaghi Hajiaghayi∗ Guy Kortsarz† DocID: 1uPZi - View Document
	Approximation Algorithms for Network Design Problems with Node Weights C. Chekuri∗ M. T. Hajiaghayi† DocID: 1uLSz - View Document