Derives a new computable performance bound for greedy schemes in string optimization that generalizes and improves on Conforti and Cornuéjols α_G and α_G'' bounds while providing a counterexample for α_G'.
Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2024 2verdicts
UNVERDICTED 2representative citing papers
Introduces DGBA for submodular task allocation in MAS under q-independence constraints, claiming polynomial-time feasibility with approximation guarantees and better performance than benchmarks in simulations.
citing papers explorer
-
A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
Derives a new computable performance bound for greedy schemes in string optimization that generalizes and improves on Conforti and Cornuéjols α_G and α_G'' bounds while providing a counterexample for α_G'.
-
Distributed Task Allocation for Multi-Agent Systems: A Submodular Optimization Approach
Introduces DGBA for submodular task allocation in MAS under q-independence constraints, claiming polynomial-time feasibility with approximation guarantees and better performance than benchmarks in simulations.