New results on a general class of minimum norm optimization problems
From MaRDI portal
Cites work
- A threshold of ln n for approximating set cover
- Adaptivity gaps for stochastic probing: submodular and XOS functions
- All-norms and all-L_p-norms approximation algorithms
- Analytical approach to parallel repetition
- Approximate multi-matroid intersection via iterative refinement
- Approximating fair clustering with cascaded norm objectives
- Approximation algorithms for minimum norm and ordered optimization problems
- Approximation algorithms for stochastic minimum-norm combinatorial optimization
- Approximation Schemes for Multi-Budgeted Independence Systems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Constant-factor approximation for ordered k-median
- Convex programming for scheduling unrelated parallel machines
- Exact matching: algorithms and related problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Generalized machine activation problems
- Generalized unrelated machine scheduling problem
- Inequalities.
- Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
- Iterative Rounding for Multi-Objective Optimization Problems
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Minimum-norm load balancing Is (almost) as easy as minimizing makespan
- Multi-budgeted matchings and matroid intersection via dependent rounding
- New approaches to multi-objective optimization
- On minimizing generalized makespan on unrelated machines
- Ordered k-Median with outliers
- Parameterized approximation schemes for clustering with general norm objectives
- Random pseudo-polynomial algorithms for exact matroid problems
- Simpler and Better Algorithms for Minimum-Norm Load Balancing
- Submodular Cost Allocation Problem and Applications
- Submodular maximization over multiple matroids via generalized exchange properties
- Submodular maximization with cardinality constraints
- The constrained minimum spanning tree problem
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Tight approximation algorithms for ordered covering
This page was built for publication: New results on a general class of minimum norm optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346486)
