Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences

DOI10.1016/J.TCS.2022.12.011MaRDI QIDQ2681004zbMATH OpenOpenAlexFDO

Authors Chao Qian, Dan-Xuan Liu, Chao Feng, Ke Tang

Publication date 5 January 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2104.09884

zbMATH Keywords

approximation ratiocomputational complexityevolutionary algorithmsexperimental studiesmulti-objective evolutionary algorithmssequencessubmodular optimization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• A unifying look at sequence submodularity
• Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
• Fast algorithms for maximizing monotone nonsubmodular functions
• Fast algorithms for maximizing monotone nonsubmodular functions

Cites work

• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Autonomous target search with multiple coordinated UAVs
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• Maximizing bisubmodular and \(k\)-submodular functions
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
• Neural architecture search: a survey
• Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
• Selecting jobs for scheduling on a machine subject to failure
• Statistical comparisons of classifiers over multiple data sets
• String Submodular Functions With Curvature Constraints
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Theory of evolutionary computation. Recent developments in discrete optimization

Cited in

(3)

• Result diversification by multi-objective evolutionary algorithms with theoretical guarantees
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations

This page was built for publication: Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2681004)