scientific article; zbMATH DE number 7378697
From MaRDI portal
Publication:5009585
DOI10.4230/LIPIcs.ESA.2018.27MaRDI QIDQ5009585
Alon Eden, Michal Feldman, Tzahi Taub, Amos Fiat
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Cites Work
- Unnamed Item
- On-line scheduling to minimize average completion time revisited.
- Approximation algorithms for scheduling unrelated parallel machines
- Coordination mechanisms for selfish scheduling
- Minimizing average completion time in the presence of release dates
- Competitive analysis of incentive compatible on-line auctions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Scheduling independent tasks to reduce mean finishing time
- Scheduling Parallel Machines On-Line
- Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing
- Competitive algorithms from competitive equilibria
- Pricing Online Decisions: Beyond Auctions
- Prompt Mechanisms for Online Auctions
- Automata, Languages and Programming
- The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
- Bounds for Certain Multiprocessing Anomalies
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Algorithmic mechanism design
