共 50 条
- [3] A tight lower bound for the Steiner Point Removal problem on trees [J]. APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 70 - 81
- [6] A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem [J]. 2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 428 - 437
- [8] A tight lower bound for the online bounded space hypercube bin packing problem [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (03):
- [10] A Near-Tight Approximation Lower Bound and Algorithm for the Kidnapped Robot Problem [J]. PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 133 - +