Showing results 4 to 6 of 6
< previous
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Online algorithms for covering and packing problems with convex objectives Proceeding/Conference:IEEE Annual Symposium on Foundations of Computer Science (FOCS) Proceedings | 2016 | 62 | ||
Online Makespan Minimization: The Power of Restart Proceeding/Conference:Proceedings of the 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX/RANDOM 2018) | 2018 | 31 | ||
Online Submodular Maximization with Free Disposal: Randomization Beats ΒΌ for Partition Matroids Proceeding/Conference:Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017 | 74 |