Polynomial-time approximation scheme
相关论文数: 7
顶级研究者
最高引用论文
Fast approximation algorithms for a nonconvex covering problem
Dorit S. Hochbaum, Wolfgang Maass
引用数: 44 • 1987
Algorithm for Optimal Chance Constrained Knapsack Problem with Applications to Multi-Robot Teaming
Fan Yang, Nilanjan Chakraborty
引用数: 12 • 2018
Algorithm for Multi-Robot Chance-Constrained Generalized Assignment Problem with Stochastic Resource Consumption
Fan Yang, Nilanjan Chakraborty
引用数: 8 • 2020
Analysis of Quality Diversity Algorithms for the Knapsack Problem
Adel Nikfarjam, Anh Viet, Frank Neumann
引用数: 6 • 2022
Integrated planning of constraint sensor management and patrolling
Hamidreza Nourzadeh, John E. McInroy
引用数: 4 • 2013
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem
Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi
引用数: 2 • 2021
Comparison of Algorithms for Constrained Multi-robot Task Allocation
Maciej Hojda
引用数: 2 • 2016