An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines

Author： Chekuri C.   Bender M.  

Publisher： Elsevier

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.41, Iss.2, 2001-11, pp. : 212-224

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The cost of selfishness for maximizing the minimum load on uniformly related machines

By Epstein Leah   Kleiman Elena   Stee Rob  

Journal of Combinatorial Optimization, Vol. 27, Iss. 4, 2014-05 ,pp. : 767-777

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Algorithm for Polarizable Interactions: A Uniformly Distributed One-Dimensional Case

By Dinh Thuy-Linh   Huber Gary  

Journal of Mathematical Modelling and Algorithms, Vol. 4, Iss. 1, 2005-03 ,pp. : 111-128

Springer Publishing Company

Access to resources Recommend Favorite

An efficient approximation algorithm for the survivable network design problem

By Gabow H.N.   Goemans M.X.   Williamson D.P.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 13-40

Elsevier

Access to resources Recommend Favorite

Makespan minimization in open shops: A polynomial time approximation scheme

By Sevastianov S.V.   J. Woeginger G.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 191-198

Elsevier

Access to resources Recommend Favorite

Local approximation of uniformly regular Carnot-Carathéodory quasispaces by their tangent cones

By Greshnov A.  

Siberian Mathematical Journal, Vol. 48, Iss. 2, 2007-03 ,pp. : 229-248

Springer Publishing Company

Access to resources Recommend Favorite