Simultaneous approximation of multi-criteria submodular function maximization
From MaRDI portal
Publication:489121
DOI10.1007/s40305-014-0053-zzbMath1307.90157OpenAlexW1974465585MaRDI QIDQ489121
Yu Li, Nai-Hua Xiu, Dong-lei Du, Da-Chuan Xu
Publication date: 27 January 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-014-0053-z
Related Items (10)
On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint ⋮ Algorithms for maximizing monotone submodular function minus modular function under noise ⋮ Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise ⋮ A constrained two-stage submodular maximization ⋮ Bicriteria algorithms to balance coverage and cost in team formation under online model ⋮ Online bicriteria algorithms to balance coverage and cost in team formation ⋮ Non-submodular streaming maximization with minimum memory and low adaptive complexity ⋮ Sequence submodular maximization meets streaming ⋮ Non-submodular maximization on massive data streams ⋮ Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Fair online load balancing
- Pricing for fairness: distributed resource allocation for multiple objectives
- Fair welfare maximization
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- The theory of search games and rendezvous.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Simultaneous optimization via approximate majorization for concave profits or convex costs
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Maximizing Non-monotone Submodular Functions
- All-Norms and All-L_p-Norms Approximation Algorithms
- Fairness Measures for Resource Allocation
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- Improved Inapproximability for Submodular Maximization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- All-norm approximation algorithms
- Many birds with one stone
- Fairness in routing and load balancing
- Combining fairness with throughput: Online routing with multiple objectives
This page was built for publication: Simultaneous approximation of multi-criteria submodular function maximization
