August 01, 1978 article Best Algorithms for Approximating the Maximum of a Submodular Set Function Mathematics of Operations Research DOI: 10.1287/moor.3.3.177 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 555 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem 2024 Genetic and Evolutionary Computation Conference (GECCO) conference-paper Computer Science Metaheuristic Optimization Algorithms Research Open access 6 citations Benchmarking Algorithms for Submodular Optimization Problems Using IOHProfiler 2023 IEEE Congress on Evolutionary Computation (CEC) conference-paper Computer Science Metaheuristic Optimization Algorithms Research Open access 3 citations 2 results References 0