The complexity of controlled three dimensional rounding

von Pruhs, Kirk
Veröffentlicht 1987

Open problems in real-time scheduling

von Baruah, Sanjoy
Veröffentlicht in Journal of scheduling (2010)

The complexity of controlled selection

von Pruhs, Kirk
Veröffentlicht 1988

On the impossibility of decomposing binary matroids

von Leichter, Marilena
Veröffentlicht in Operations research letters (2022)

A randomized algorithm for online metric b-matching

von Kalyanasundaram, Bala
Veröffentlicht in Operations research letters (2023)

An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line

von Arndt, Stephen
Veröffentlicht in Annual International Conference on Combinatorial Optimization and Applications (16. : 2023 : Honolulu, Hawaii) Combinatorial optimization and applications ; Part 1 (2024)

The matroid intersection cover problem

von Im, Sungjin
Veröffentlicht in Operations research letters (2021)

A. Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a Spider

von Bender, Max
Veröffentlicht in FCT (23. : 2021 : Online) Fundamentals of computation theory (2021)

Speed scaling for stretch plus energy

Veröffentlicht in Operations research letters (2012)

Special issue on approximation and online algorithms

Veröffentlicht 2016

The one-dimensional Euclidean domain : finitely many obstructions are not enough

von Chen, Jiehua
Veröffentlicht in Social choice and welfare (2017)

Competitively Pricing Parking in a Tree

von Bender, Max
Veröffentlicht in WINE (16. : 2020 : Online) Web and internet economics (2020)

Approximation and online algorithms : 11th international workshop, WAOA 2013, Sophia Antipolis, France, September 5 - 6, 2013 ; revised selected papers

Veröffentlicht 2014

A Competitive Algorithm for Throughput Maximization on Identical Machines

von Moseley, Benjamin
Veröffentlicht in IPCO (23. : 2022 : Eindhoven) Integer programming and combinatorial optimization (2022)

Approximate Aggregate Queries under Additive Inequalities

von Abo-Khamis, Mahmoud
Veröffentlicht in SIAM Symposium on Algorithmic Principles of Computer Systems (2. : 2021 : Online) Symposium on Algorithmic Principles of Computer Systems (APOCS21) (2021)