List's worst-average-case or WAC ratio
From MaRDI portal
Publication:835596
DOI10.1007/S10951-007-0019-7zbMATH Open1168.90463OpenAlexW2077203517MaRDI QIDQ835596FDOQ835596
Authors: Christopher J. Osborn, Eric Torng 
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-007-0019-7
Recommendations
- List factoring and relative worst order analysis
- List Factoring and Relative Worst Order Analysis
- Ratio List Decoding
- Worst-case robust Omega ratio
- Ratio and weight quantiles
- Worst-case expected utility
- Abstract Interpretation for Worst and Average Case Analysis
- Average case selection
- The weighted sequential likelihood ratio
- Worst-case versus average-case design for estimation from partial pairwise comparisons
Cites Work
- On-line scheduling revisited
- Bounds for Certain Multiprocessing Anomalies
- A better lower bound for on-line scheduling
- Title not available (Why is that?)
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- New algorithms for an ancient scheduling problem.
- Title not available (Why is that?)
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- New lower and upper bounds for on-line scheduling
- A Better Algorithm for an Ancient Scheduling Problem
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: List's worst-average-case or WAC ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835596)
