No. Title Author Year
1 Average Sensitivity of the Knapsack Problem Kumabe, Soh et al. 2022
2 Downsampling for Testing and Learning in Product Distributions Harms, Nathaniel et al. 2022
3 One-Tape Turing Machine and Branching Program Lower Bounds for MCSP Cheraghchi, Mahdi et al. 2021
4 Ordered Graph Limits and Their Applications Ben-Eliezer, Omri et al. 2021
5 Sensitivity Analysis of the Maximum Matching Problem Yoshida, Yuichi et al. 2021
6 Distribution-Free Testing of Linear Functions on ℝⁿ Fleming, Noah et al. 2020
7 Weakly Submodular Function Maximization Using Local Submodularity Ratio Santiago, Richard et al. 2020
8 A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity Soma, Tasuku et al. 2018
9 Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices Levi, Amit et al. 2018
10 Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint Huang, Chien-Chung et al. 2017
11 Robust Approximation of Temporal CSP Tamaki, Suguru et al. 2014
12 Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra Iwata, Yoichi et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 12

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