共 50 条
- [1] To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2017, : 879 - 888
- [2] On approximability of the minimum-cost k-connected spanning subgraph problem PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 281 - 290
- [4] An Improved Approximation Algorithm for the Minimum Cost Subset k-Connected Subgraph Problem Algorithmica, 2015, 72 : 714 - 733
- [8] Minimum Strongly Connected Subgraph Collection in Dynamic Graphs PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (06): : 1324 - 1336
- [10] A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 4296 - 4334