Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10288-010-0127-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076173115 / rank
 
Normal rank

Revision as of 22:34, 19 March 2024

scientific article
Language Label Description Also known as
English
Scheduling \(UET\)-tasks on a star network: complexity and approximation
scientific article

    Statements

    Scheduling \(UET\)-tasks on a star network: complexity and approximation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    non-approximability
    0 references
    approximation
    0 references
    0 references