Machine covering in the random-order model (Q6103518): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-022-01011-0 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3206545831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best fit bin packing with random order revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved online algorithms for Knapsack and GAP in the random order model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line machine covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knapsack Secretary Problem with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid Secretary Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Santa Claus problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound for on-line scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on makespan minimization in semi-online environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-min Online Allocations with a Reordering Buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Greedy Solutions for a Replacement Part Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Exploitation for Online Machine Covering with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Appointment Scheduling in the Random Order Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Order Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3622892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Algorithm for an Ancient Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal Beats Dual on Online Packing LPs in the Random-Order Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling via Learned Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with Predictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and Random-order Load Balancing Simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: List's worst-average-case or WAC ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Bounded Migration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-022-01011-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:28, 30 December 2024

scientific article; zbMATH DE number 7691813
Language Label Description Also known as
English
Machine covering in the random-order model
scientific article; zbMATH DE number 7691813

    Statements

    Machine covering in the random-order model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 June 2023
    0 references
    machine covering
    0 references
    random-order
    0 references
    online algorithms
    0 references
    scheduling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers