Suchergebnisse - "Scheduling Approximation Complexity"

  • Treffer 1 - 1 von 1
Treffer weiter einschränken
  1. 1

    Approximation algorithms for Job Scheduling with reconfigurable resources

    Autoren: Bergé, Pierre Chaikovskaia, Mari Gayon, Jean-Philippe et al.

    Weitere Verfasser: Bergé, Pierre Chaikovskaia, Mari Gayon, Jean-Philippe et al.

    Schlagwörter: FOS: Computer and information sciences, Scheduling, Scheduling Approximation Complexity, [INFO]Computer Science [cs], Data Structures and Algorithms (cs.DS), Complexity, F.2.2, [INFO] Computer Science [cs], Approximation

    Dateibeschreibung: application/pdf

    Zugangs-URL: https://hal.science/hal-04514376v1
    https://hal.science/hal-04514376v1/document
    https://doi.org/10.48550/arxiv.2401.00419

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: