Towards Tight Lower Bounds for Scheduling Problems (Q3452775): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Long Code Test with One Free Bit / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Preemptive Scheduling of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Preemptive Scheduling on Two-Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Precedence Constrained Scheduling on Identical Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank

Latest revision as of 02:13, 11 July 2024

scientific article
Language Label Description Also known as
English
Towards Tight Lower Bounds for Scheduling Problems
scientific article

    Statements

    Towards Tight Lower Bounds for Scheduling Problems (English)
    0 references
    0 references
    0 references
    19 November 2015
    0 references
    hardness of approximation
    0 references
    scheduling problems
    0 references
    unique games conjecture
    0 references

    Identifiers