Simultaneous approximation of multi-criteria submodular function maximization
From MaRDI portal
(Redirected from Publication:489121)
Recommendations
Cites work
- scientific article; zbMATH DE number 1128781 (Why is no real title available?)
- scientific article; zbMATH DE number 2086914 (Why is no real title available?)
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- All-norm approximation algorithms
- All-norms and all-\(L_p\)-norms approximation algorithms
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combining fairness with throughput: Online routing with multiple objectives
- Fair online load balancing
- Fair welfare maximization
- Fairness Measures for Resource Allocation
- Fairness in routing and load balancing
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved inapproximability for submodular maximization
- Many birds with one stone
- Maximizing Non-monotone Submodular Functions
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time
- Pricing for fairness: distributed resource allocation for multiple objectives
- Simultaneous optimization via approximate majorization for concave profits or convex costs
- The theory of search games and rendezvous.
Cited in
(13)- Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise
- Online bicriteria algorithms to balance coverage and cost in team formation
- Non-submodular streaming maximization with minimum memory and low adaptive complexity
- Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
- Simultaneous selection
- An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint
- Non-submodular maximization on massive data streams
- Algorithms for maximizing monotone submodular function minus modular function under noise
- A constrained two-stage submodular maximization
- Multi-agent submodular optimization
- On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint
- Bicriteria algorithms to balance coverage and cost in team formation under online model
- Sequence submodular maximization meets streaming
This page was built for publication: Simultaneous approximation of multi-criteria submodular function maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489121)
