Tight Performance Bounds of CP-Scheduling on Out-Trees

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.5, Iss.4, 2001-12, pp. : 445-464

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

Tight Bounds for the Maximum Acyclic Subgraph Problem

By Berger B. Shor P.W.

Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. : 1-18

Academic Press

Access to resources Recommend Favorite

Probability Bounds Given by Hypercherry Trees

By Bukszár József Szántai Tamás

Optimization Methods and Software, Vol. 17, Iss. 3, 2002-01 ,pp. : 409-422

Taylor & Francis Ltd

Access to resources Recommend Favorite

Improved bounds for batch scheduling with nonidentical job sizes

Naval Research Logistics: An International Journal, Vol. 61, Iss. 5, 2014-08 ,pp. : 351-358

John Wiley & Sons Inc

Access to resources Recommend Favorite

Tight upper bounds on the number of invariant components on translation surfaces

By Naveh Yoav

Israel Journal of Mathematics, Vol. 165, Iss. 1, 2008-06 ,pp. : 211-231

Springer Publishing Company

Access to resources Recommend Favorite

Tight bounds for rational sums of squares over totally real fields

By Quarez Ronan

Rendiconti del Circolo Matematico di Palermo, Vol. 59, Iss. 3, 2010-12 ,pp. : 377-388

Springer Publishing Company

Access to resources Recommend Favorite