Simultaneous approximation of multi-criteria submodular function maximization

DOI10.1007/S40305-014-0053-ZzbMATH Open1307.90157OpenAlexW1974465585MaRDI QIDQ489121FDOQ489121

Naihua Xiu, Donglei Du, Dachuan Xu, Yu Li

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

Recommendations

• Maximizing Non-monotone Submodular Functions
• Submodular maximization by simulated annealing
• Maximizing symmetric submodular functions
• Symmetry and approximability of submodular maximization problems
• Maximizing symmetric submodular functions

zbMATH Keywords

approximation algorithmexistencemulti-criteriasubmodular function maximization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites Work

• The theory of search games and rendezvous.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Title not available (Why is that?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Fairness in routing and load balancing
• All-Norms and All-L_p-Norms Approximation Algorithms
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Approximation algorithms for the bi-criteria weighted MAX-CUT problem
• Maximizing Non-monotone Submodular Functions
• A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
• Many birds with one stone
• Simultaneous optimization via approximate majorization for concave profits or convex costs
• Fairness Measures for Resource Allocation
• Fair online load balancing
• All-norm approximation algorithms
• Combining fairness with throughput: Online routing with multiple objectives
• Fair welfare maximization
• Improved Inapproximability for Submodular Maximization
• Title not available (Why is that?)
• Pricing for fairness: distributed resource allocation for multiple objectives

Cited In (11)

• A constrained two-stage submodular maximization
• 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
• An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint
• 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
• Non-submodular maximization on massive data streams
• Sequence submodular maximization meets streaming
• Bicriteria streaming algorithms to balance gain and cost with cardinality constraint
• On maximizing the difference between an approximately submodular function and a linear function subject to a matroid constraint

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)