No. Title Author Year
1 Beating the Folklore Algorithm for Dynamic Matching Roghani, Mohammad et al. 2022
2 Near-Optimal Schedules for Simultaneous Multicasts Haeupler, Bernhard et al. 2021
3 The Greedy Algorithm Is not Optimal for On-Line Edge Coloring Saberi, Amin et al. 2021
4 Stochastic Online Metric Matching Gupta, Anupam et al. 2019
5 Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms Arar, Moab et al. 2018
6 Fully-Dynamic Bin Packing with Little Repacking Feldkord, Björn et al. 2018
7 Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching Ghaffari, Mohsen et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 7

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI