Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints
Authors: Chao Bian, Chao Qian, Frank Neumann, Yang Yu
IJCAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We prove that FPOMC can maintain the best known approximation guarantee efficiently.In this section, we prove the general approximation bound of FPOMC in Theorem 6, implying that FPOMC can achieve the best known polynomial-time approximation guarantee, i.e., (αf/2)(1 e αf ). |
| Researcher Affiliation | Academia | 1State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China 2Optimisation and Logistics, The University of Adelaide, Adelaide SA 5005, Australia |
| Pseudocode | Yes | Algorithm 1 FPOMC Algorithm, Algorithm 2 SELECT(P): Subroutine of FPOMC, Algorithm 3 LS(x): Subroutine of FPOMC |
| Open Source Code | No | The paper does not provide any statement or link regarding the availability of open-source code for the proposed methodology. |
| Open Datasets | No | The paper is theoretical and does not conduct experiments, therefore it does not refer to any train dataset or its accessibility. |
| Dataset Splits | No | The paper is theoretical and does not conduct experiments, therefore it does not specify any validation dataset splits. |
| Hardware Specification | No | The paper does not conduct experiments and therefore does not specify any hardware used. |
| Software Dependencies | No | The paper does not conduct experiments and therefore does not specify any software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not include an experimental setup or details like hyperparameters. |