共 50 条
- [41] Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 683 - 691
- [42] A polynomial algorithm to find an independent set of maximum weight in a fork-free graph PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 26 - 30
- [47] Distributed Approximation of Maximum Independent Set and Maximum Matching PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, : 165 - 174
- [48] PTAS for maximum weight independent set problem with random weights in bounded degree graphs PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 268 - 278
- [49] Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations 2021 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2021, : 128 - 142
- [50] On Approximating Maximum Independent Set of Rectangles 2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 820 - 829