scientific article; zbMATH DE number 7561547

DOI10.4230/LIPIcs.ICALP.2019.54MaRDI QIDQ5091209

No author found.

Publication date: 21 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

submodular maximizationmatroid constraintsfast running times

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Efficient Submodular Function Maximization under Linear Packing Constraints
• On Multiplicative Weight Updates for Concave and Submodular Function Maximization
• A threshold of ln n for approximating set cover
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Efficiency of a Good But Not Linear Set Union Algorithm
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• An improved equivalence algorithm
• Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
• Submodular Maximization with Cardinality Constraints
• Fast algorithms for maximizing submodular functions
• Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
• Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search

This page was built for publication: