No. Title Author Year
1 Sublinear Algorithms and Lower Bounds for Estimating MST and TSP Cost in General Metrics Chen, Yu et al. 2023
2 Optimal Bounds for Dominating Set in Graph Streams Khanna, Sanjeev et al. 2022
3 Graph Connectivity and Single Element Recovery via Linear and OR Queries Assadi, Sepehr et al. 2021
4 Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries Chen, Yu et al. 2021
5 An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs De, Anindya et al. 2020
6 Sublinear Algorithms and Lower Bounds for Metric TSP Cost Estimation Chen, Yu et al. 2020
7 A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling Assadi, Sepehr et al. 2018
8 Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling Chakrabarty, Deeparnab et al. 2018
9 Algorithms for Provisioning Queries and Analytics Assadi, Sepehr et al. 2016
10 Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches Assadi, Sepehr et al. 2015
11 STCON in Directed Unique-Path Graphs Kannan, Sampath et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 11

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