A faster FPTAS for knapsack problem with cardinality constraint
From MaRDI portal
Publication:5918631
DOI10.1007/978-3-030-80879-2_2OpenAlexW3185070659MaRDI QIDQ5918631
Ness B. Shroff, Joohyun Lee, Wenxin Li
Publication date: 22 March 2022
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.00919
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization models for targeted offers in direct marketing: exact and heuristic algorithms
- Linear time algorithms for some separable quadratic programming problems
- Approximation algorithms for knapsack problems with cardinality constraints
- Bin packing with general cost structures
- Hybrid rounding techniques for knapsack problems
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A Note on Approximation Schemes for Multidimensional Knapsack Problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- Truthful Data Quality Elicitation for Quality-Aware Data Crowdsourcing
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
This page was built for publication: A faster FPTAS for knapsack problem with cardinality constraint
