共 50 条
- [32] Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2492 - 2508
- [34] Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2492 - 2508
- [35] A polynomial time approximation scheme for dense MIN 2SAT FUNDAMENTALS OF COMPUTATION THEORY, 1999, 1684 : 91 - 99
- [36] A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization 2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 649 - 658
- [37] A Single-Exponential Time 2-Approximation Algorithm for Treewidth 2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 184 - 192
- [38] DIFFUSION APPROXIMATION FOR THE STOCHASTIC SELECTION MODEL WITH TIME DURATION .2. JAPANESE JOURNAL OF GENETICS, 1980, 55 (06): : 458 - 458
- [39] ROTON 2ND SOUND IN RELAXATION-TIME APPROXIMATION PHYSICAL REVIEW B, 1977, 15 (09): : 4227 - 4233