{"list":"other","total":58,"rows":[{"id":"1802.05399","title":"Competitive caching with machine learned advice","created":"2018-02-15","cited_by_count":195},{"id":"2005.07959","title":"Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Models","created":"2020-05-16","cited_by_count":116},{"id":"2010.11632","title":"The Primal-Dual method for Learning Augmented Algorithms","created":"2020-10-22","cited_by_count":80},{"id":"2003.02144","title":"Online metric algorithms with untrusted predictions","created":"2020-03-04","cited_by_count":75},{"id":"2006.01026","title":"Secretary and Online Matching Problems with Machine Learned Advice","created":"2020-06-01","cited_by_count":71},{"id":"2407.17712","title":"Improving Online Algorithms via ML Predictions","created":"2024-07-25","cited_by_count":66},{"id":"1901.00902","title":"A Model for Learned Bloom Filters, and Optimizing by Sandwiching","created":"2019-01-03","cited_by_count":64},{"id":"2107.09770","title":"Faster Matchings via Learned Duals","created":"2021-07-20","cited_by_count":56},{"id":"1905.05655","title":"Online Computation with Untrusted Advice","created":"2019-05-14","cited_by_count":42},{"id":"2204.12055","title":"Faster Fundamental Graph Algorithms via Learned Predictions","created":"2022-04-26","cited_by_count":42},{"id":"1910.13984","title":"Learning-Based Low-Rank Approximations","created":"2019-10-30","cited_by_count":41},{"id":"2206.12110","title":"Learning Augmented Binary Search Trees","created":"2022-06-24","cited_by_count":31},{"id":"1412.0681","title":"Near Optimal LP Rounding Algorithm for Correlation Clustering on Complete and Complete k-partite Graphs","created":"2014-12-01","cited_by_count":27},{"id":"2110.14094","title":"Learning-Augmented $k$-means Clustering","created":"2021-10-27","cited_by_count":26},{"id":"2007.09890","title":"Learning the Positions in CountSketch","created":"2020-07-20","cited_by_count":20},{"id":"2203.09572","title":"Triangle and Four Cycle Counting with Predictions in Graph Streams","created":"2022-03-17","cited_by_count":20},{"id":"2303.00837","title":"Predictive Flows for Faster Ford-Fulkerson","created":"2023-03-01","cited_by_count":20},{"id":"2204.01120","title":"Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location","created":"2022-04-03","cited_by_count":19},{"id":"2106.08396","title":"Learning-based Support Estimation in Sublinear Time","created":"2021-06-15","cited_by_count":16},{"id":"2106.08448","title":"Correlation Clustering in Constant Many Parallel Rounds","created":"2021-06-15","cited_by_count":15},{"id":"2207.10889","title":"Correlation Clustering with Sherali-Adams","created":"2022-07-22","cited_by_count":15},{"id":"1712.05825","title":"Unifying Sparsest Cut, Cluster Deletion, and Modularity Clustering Objectives with Correlation Clustering","created":"2017-12-15","cited_by_count":12},{"id":"2407.11364","title":"Learning-augmented Maximum Independent Set","created":"2024-07-16","cited_by_count":11},{"id":"2210.17028","title":"Improved Learning-augmented Algorithms for k-means and k-medians Clustering","created":"2022-10-31","cited_by_count":10},{"id":"2312.07535","title":"Improved Frequency Estimation Algorithms with and without Predictions","created":"2023-12-12","cited_by_count":10},{"id":"1506.08189","title":"Correlation Clustering and Biclustering with Locally Bounded Errors","created":"2015-06-26","cited_by_count":9},{"id":"2108.01731","title":"Scalable Community Detection via Parallel Correlation Clustering","created":"2021-07-27","cited_by_count":9},{"id":"2205.04252","title":"Improved Price of Anarchy via Predictions","created":"2022-05-09","cited_by_count":9},{"id":"2307.09961","title":"On Dynamic Graph Algorithms with Predictions","created":"2023-07-19","cited_by_count":9},{"id":"2307.16771","title":"On the Complexity of Algorithms with Predictions for Dynamic Graph Problems","created":"2023-07-31","cited_by_count":9},{"id":"1704.00355","title":"Local Guarantees in Graph Cuts and Clustering","created":"2017-04-02","cited_by_count":8},{"id":"2305.13560","title":"Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!","created":"2023-05-23","cited_by_count":8},{"id":"2411.16600","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","created":"2024-11-25","cited_by_count":8},{"id":"2412.09773","title":"Learning-Augmented Streaming Algorithms for Approximating MAX-CUT","created":"2024-12-13","cited_by_count":8},{"id":"1812.02023","title":"Correlation Clustering in Data Streams","created":"2018-12-05","cited_by_count":7},{"id":"2109.14528","title":"Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions","created":"2021-09-29","cited_by_count":7},{"id":"2205.11313","title":"Mechanism Design with Predictions","created":"2022-05-23","cited_by_count":7},{"id":"2402.01400","title":"Query-Efficient Correlation Clustering with Noisy Oracle","created":"2024-02-02","cited_by_count":7},{"id":"2205.03710","title":"Almost 3-Approximate Correlation Clustering in Constant Rounds","created":"2022-05-07","cited_by_count":6},{"id":"2306.02846","title":"Fast Partitioned Learned Bloom Filter","created":"2023-06-05","cited_by_count":6},{"id":"2309.17243","title":"Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering","created":"2023-09-29","cited_by_count":6},{"id":"2403.02212","title":"Constraint Satisfaction Problems with Advice","created":"2024-03-04","cited_by_count":6},{"id":"2404.17509","title":"Understanding the Cluster LP for Correlation Clustering","created":"2024-04-26","cited_by_count":6},{"id":"2503.20883","title":"Solving the Correlation Cluster LP in Sublinear Time","created":"2025-03-26","cited_by_count":5},{"id":"2212.14220","title":"Graph Searching with Predictions","created":"2022-12-29","cited_by_count":4},{"id":"2310.09196","title":"A 4-approximation algorithm for min max correlation clustering","created":"2023-10-13","cited_by_count":4},{"id":"2402.17736","title":"Learning-Based Algorithms for Graph Searching Problems","created":"2024-02-27","cited_by_count":4},{"id":"2404.05433","title":"Combinatorial Correlation Clustering","created":"2024-04-08","cited_by_count":4},{"id":"2307.06723","title":"Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds","created":"2023-07-13","cited_by_count":3},{"id":"2402.15668","title":"Pruned Pivot: Correlation Clustering Algorithm for Dynamic, Parallel, and Local Computation Models","created":"2024-02-24","cited_by_count":3},{"id":"2205.07593","title":"A $(3+\\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams","created":"2022-05-16","cited_by_count":2},{"id":"2401.13384","title":"Randomized learning-augmented auctions with revenue guarantees","created":"2024-01-24","cited_by_count":2},{"id":"2404.06797","title":"Correlation Clustering Beyond the Pivot Algorithm","created":"2024-04-10","cited_by_count":2},{"id":"2410.09321","title":"Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering","created":"2024-10-12","cited_by_count":2},{"id":"2503.00937","title":"Learning-Augmented Frequent Directions","created":"2025-03-02","cited_by_count":2},{"id":"2309.15414","title":"Competitive Auctions with Imperfect Predictions","created":"2023-09-27","cited_by_count":1},{"id":"2403.03725","title":"To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model","created":"2024-03-06","cited_by_count":1},{"id":"2504.04258","title":"Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms","created":"2025-04-05","cited_by_count":1}],"next_cursor":null}