scientific article
From MaRDI portal
Publication:2999661
zbMath1219.68109MaRDI QIDQ2999661
Publication date: 16 May 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial aspects of matroids and geometric lattices (05B35) Approximation algorithms (68W25)
Related Items (25)
Maximizing a non-decreasing non-submodular function subject to various types of constraints ⋮ Unnamed Item ⋮ An accelerated continuous greedy algorithm for maximizing strong submodular functions ⋮ Analyzing Residual Random Greedy for monotone submodular maximization ⋮ Distributed strategy selection: a submodular set function maximization approach ⋮ On Submodular Search and Machine Scheduling ⋮ Improved bounds for the greedy strategy in optimization problems with curvature ⋮ Unified Greedy Approximability beyond Submodular Maximization ⋮ Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions ⋮ Unified greedy approximability beyond submodular maximization ⋮ Unnamed Item ⋮ Greedy guarantees for non-submodular function maximization under independent system constraint with applications ⋮ Deterministic approximation algorithm for submodular maximization subject to a matroid constraint ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ New performance guarantees for the greedy maximization of submodular set functions ⋮ Unnamed Item ⋮ Approximating Robust Parameterized Submodular Function Maximization in Large-Scales ⋮ Maximizing expected utility over a knapsack constraint ⋮ Performance bounds with curvature for batched greedy optimization ⋮ Approximation for maximizing monotone non-decreasing set functions with a greedy method ⋮ Fast algorithms for maximizing monotone nonsubmodular functions ⋮ Fast algorithms for maximizing monotone nonsubmodular functions ⋮ Pareto optimization for subset selection with dynamic cost constraints ⋮ Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint ⋮ Minimizing ratio of monotone non-submodular functions
This page was built for publication:
