On polynomial-time approximation algorithms for the variable length scheduling problem

Author： Czumaj A.   Gasieniec L.   Gaur D.R.   Krishnamurti R.   Rytter W.   Zito M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.302, Iss.1, 2003-06, pp. : 489-495

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

Polynomial-time approximation schemes for scheduling problems with time lags

By Zhang Xiandong   Velde Steef  

Journal of Scheduling, Vol. 13, Iss. 5, 2010-10 ,pp. : 553-559

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem

By Dessmark Anders   Jansson Jesper   Lingas Andrzej   Lundell Eva-Marta  

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 233-248

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

By Brucker Peter  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 371-389

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial-Time Decomposition Algorithms for Support Vector Machines

By Hush D.  

Machine Learning, Vol. 51, Iss. 1, 2003-04 ,pp. : 51-71

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

By Detti Paolo   Agnetis Alessandro   Ciaschetti Gianfranco  

Journal of Scheduling, Vol. 8, Iss. 3, 2005-06 ,pp. : 255-273

Springer Publishing Company

Access to resources Recommend Favorite