Approximating Scheduling Machines with Capacity Constraints (Q5321720): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4796176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factor 2 approximation algorithm for the generalized Steiner network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum bounded degree spanning trees to within one of optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comment on scheduling two parallel machines with capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling two parallel machines with capacity constraints. / rank
 
Normal rank

Latest revision as of 19:28, 1 July 2024

scientific article; zbMATH DE number 5578484
Language Label Description Also known as
English
Approximating Scheduling Machines with Capacity Constraints
scientific article; zbMATH DE number 5578484

    Statements

    Approximating Scheduling Machines with Capacity Constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 July 2009
    0 references
    0 references
    approximation
    0 references
    scheduling
    0 references
    capacity constraints
    0 references
    iterative rounding
    0 references
    0 references
    0 references