scientific article; zbMATH DE number 7376026
From MaRDI portal
Publication:5002781
DOI10.4230/LIPIcs.ICALP.2018.99zbMath1503.90120arXiv1709.02910MaRDI QIDQ5002781
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1709.02910
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- \(M\)-convex functions and tree metrics
- Extension of M-convexity and L-convexity to polyhedral convex functions
- A robust model for finding optimal evolutionary tree
- Combinatorial auctions with decreasing marginal utilities
- M-Convex Function on Generalized Polymatroid
- Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS
- An analysis of approximations for maximizing submodular set functions—I
- Discrete Convex Analysis
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- When Are Welfare Guarantees Robust
- Stability and Recovery for Independence Systems
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints
This page was built for publication:
