Approximate strong separation with application in fractional graph coloring and preemptive scheduling

Publisher： Elsevier

ISSN： 0304-3975

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

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

Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring

By Jansen Klaus Porkolab Lorant

Journal of Scheduling, Vol. 7, Iss. 1, 2004-01 ,pp. : 35-48

Springer Publishing Company

Access to resources Recommend Favorite

The Strict Strong Coloring Based Graph Distribution Algorithm

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 4, Iss. 1, 2013-01 ,pp. : 50-66

IGI Global_journal

Access to resources Recommend Favorite

Facets of the Graph Coloring Polytope

By Coll P.

Annals of Operations Research, Vol. 116, Iss. 1-4, 2002-10 ,pp. : 79-90

Springer Publishing Company

Access to resources Recommend Favorite

Frozen development in graph coloring

By Culberson J. Gent I.

Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. : 227-264

Elsevier

Access to resources Recommend Favorite

Preemptive scheduling in overloaded systems

By Chrobak M. Epstein L. Noga J. Sgall J. van Stee R. Tichy T. Vakhania N.

Journal of Computer and System Sciences, Vol. 67, Iss. 1, 2003-08 ,pp. : 183-197

Elsevier

Access to resources Recommend Favorite