共 50 条
- [33] Frugal Auction Design for Set Systems: Vertex Cover and Knapsack ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2018, : 645 - 662
- [34] Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 74 - +
- [38] Online Deterministic Algorithms for Connected Dominating Set & Set Cover Leasing Problems PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2020, : 121 - 128
- [40] Set Cover Problems with Small Neighborhood Covers Theory of Computing Systems, 2018, 62 : 1763 - 1797