LNCS[removed]Dual Techniques for Scheduling on a Machine with Varying Speed

First Page		Document Content
Date: 2013-07-12 04:32:05 Mathematics Mathematical optimization Approximation algorithms Complexity classes Planning Job shop scheduling Polynomial-time approximation scheme Scheduling Dynamic programming Operations research Applied mathematics Theoretical computer science		LNCS[removed]Dual Techniques for Scheduling on a Machine with Varying Speed Add to Reading List Source URL: www.coga.tu-berlin.de Download Document from Source Website File Size: 231,93 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