Valuated matroid-based algorithm for submodular welfare problem
From MaRDI portal
Publication:492835
DOI10.1007/S10479-015-1835-3zbMATH Open1352.90086OpenAlexW1986174745MaRDI QIDQ492835FDOQ492835
Authors: Takanori Maehara, Kazuo Murota 
Publication date: 21 August 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1835-3
Recommendations
- Optimal approximation for the submodular welfare problem in the value oracle model
- Maximizing a monotone submodular function subject to a matroid constraint
- The submodular welfare problem with demand queries
- Welfare maximization and the supermodular degree
- Online submodular welfare maximization: greedy is optimal
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Discrete Convex Analysis
- Title not available (Why is that?)
- Walrasian equilibrium with gross substitutes
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Submodular functions and optimization.
- Title not available (Why is that?)
- Job Matching, Coalition Formation, and Gross Substitutes
- Combinatorial auctions with decreasing marginal utilities
- Matrices and matroids for systems analysis
- A survey of very large-scale neighborhood search techniques
- Title not available (Why is that?)
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
- Buying several indivisible goods
- Matroid rank functions and discrete concavity
- Improved Approximation Algorithms for Budgeted Allocations
- Recent developments in discrete convex analysis
- Valuated matroids
- A genetic algorithm for the generalised assignment problem
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Tight approximation algorithms for maximum general assignment problems
- Valuated matroids: A new look at the greedy algorithm
- Discrete convex analysis
- Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
- Submodular function minimization and maximization in discrete convex analysis
- Budgeted Allocations in the Full-Information Setting
- Title not available (Why is that?)
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Title not available (Why is that?)
- Algorithm Theory - SWAT 2004
- Energy Efficient Monitoring in Sensor Networks
Cited In (1)
Uses Software
This page was built for publication: Valuated matroid-based algorithm for submodular welfare problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492835)
