Approximation Schemes for Multi-Budgeted Independence Systems
From MaRDI portal
(Redirected from Publication:3586491)
Recommendations
- Approximation algorithms for a generalization of the maximum budget allocation
- On the approximability of budget feasible mechanisms
- Improved Approximation Algorithms for Budgeted Allocations
- An improved approximation guarantee for the maximum budgeted allocation problem
- Approximation algorithms for multi-budgeted network design problems
- Approximate separable multichoice optimization over monotone systems
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems
- scientific article; zbMATH DE number 1833405
- scientific article; zbMATH DE number 79287
Cited in
(15)- Budgeted colored matching problems
- Bi-criteria and approximation algorithms for restricted matchings
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Iterative Rounding for Multi-Objective Optimization Problems
- New approaches to multi-objective optimization
- Multi-budgeted matching problems
- Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- An FPTAS for budgeted laminar matroid independent set
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- Lower bounds for matroid optimization problems with a linear constraint
- Budgeted matroid maximization: a parameterized viewpoint
- Unsplittable flow on a short path
- New results on a general class of minimum norm optimization problems
This page was built for publication: Approximation Schemes for Multi-Budgeted Independence Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586491)
