Showing results 1 to 5 of 5
Title | Author(s) | Issue Date | |
---|---|---|---|
A PTAS for the steiner forest problem in doubling metrics Proceeding/Conference:IEEE Annual Symposium on Foundations of Computer Science, FOCS 2016 | 2016 | ||
Online Submodular Maximization Problem with Vector Packing Constraint Proceeding/Conference:The Annual European Symposium on Algorithms | 2017 | ||
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 | ||
Revealing optimal thresholds for generalized secretary problem via continuous LP: impacts on online K-item auction and bipartite K-matching with random arrival order Proceeding/Conference:Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2015 | ||
Scheduling Placement-Sensitive BSP Jobs with Inaccurate Execution Time Estimation Proceeding/Conference:IEEE INFOCOM - IEEE Conference on Computer Communications | 2020 |