Randomized approximation and online algorithms for assignment problems
From MaRDI portal
Recommendations
- Near optimal online algorithms and fast approximation algorithms for resource allocation problems
- The online stochastic generalized assignment problem
- scientific article; zbMATH DE number 2077129
- Randomized algorithms for online knapsack problems
- Approximation algorithms for the partial assignment problem
- scientific article; zbMATH DE number 1003270
- Efficient approximation and online algorithms. Recent progress on classical combinatorial optimization problems and new applications
- Efficient approximations for the online dispersion problem
- Efficient Approximations for the Online Dispersion Problem
- Approximation algorithms for stochastic online matching with reusable resources
Cited in
(10)- Randomized algorithms for on-line scheduling problems: How low can't you go?
- Randomized Online Algorithms with High Probability Guarantees
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- scientific article; zbMATH DE number 1003270 (Why is no real title available?)
- The optimality of the online greedy algorithm in carpool and chairman assignment problems
- On the online track assignment problem
- Robust assignments via ear decompositions and randomized rounding
- scientific article; zbMATH DE number 7053386 (Why is no real title available?)
- An on-line assignment problem with random effectiveness and costly information
- Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
This page was built for publication: Randomized approximation and online algorithms for assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789264)
