Online Appointment Scheduling in the Random Order Model (Q3452831): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Dynamic Near-Optimal Algorithm for Online Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms and Analysis for Secretary Problems and Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Appointment Scheduling with Discrete Random Durations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Covering and Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based online scheduling: From single to parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Packing Applied to Display Ad Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple <tt><i>O</i>(log log(rank))</tt>-Competitive Algorithm for the Matroid Secretary Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling on a single machine: Minimizing the total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods / 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: Matroid prophet inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling to minimize average completion time revisited. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Algorithms for Stochastic Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight 2-Approximation for Preemptive Stochastic Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: AdWords and generalized online matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of Online Packing Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of \(\alpha\)-points in preemptive single machine scheduling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of preemptive single-machine scheduling / rank
 
Normal rank

Latest revision as of 02:15, 11 July 2024

scientific article
Language Label Description Also known as
English
Online Appointment Scheduling in the Random Order Model
scientific article

    Statements

    Online Appointment Scheduling in the Random Order Model (English)
    0 references
    0 references
    0 references
    0 references
    19 November 2015
    0 references

    Identifiers