Polynomial-time approximation scheme

Fast approximation algorithms for a nonconvex covering problem

Dorit S. Hochbaum, Wolfgang Maass

Citations: 44 • 1987

Algorithm for Optimal Chance Constrained Knapsack Problem with Applications to Multi-Robot Teaming

Fan Yang, Nilanjan Chakraborty

Citations: 12 • 2018

Algorithm for Multi-Robot Chance-Constrained Generalized Assignment Problem with Stochastic Resource Consumption

Fan Yang, Nilanjan Chakraborty

Citations: 8 • 2020

Analysis of Quality Diversity Algorithms for the Knapsack Problem

Adel Nikfarjam, Anh Viet, Frank Neumann

Citations: 6 • 2022

Integrated planning of constraint sensor management and patrolling

Hamidreza Nourzadeh, John E. McInroy

Citations: 4 • 2013

New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem

Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti, Mirko Rossi

Citations: 2 • 2021

Comparison of Algorithms for Constrained Multi-robot Task Allocation

Maciej Hojda

Citations: 2 • 2016