Approximation Schemes for Multi-Budgeted Independence Systems
From MaRDI portal
Publication:3586491
DOI10.1007/978-3-642-15775-2_46zbMATH Open1287.90059OpenAlexW1549767001MaRDI QIDQ3586491FDOQ3586491
Authors: Fabrizio Grandoni, Rico Zenklusen
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_46
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 (11)
- An FPTAS for budgeted laminar matroid independent set
- New approaches to multi-objective optimization
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Budgeted colored matching problems
- Multi-budgeted matching problems
- Iterative Rounding for Multi-Objective Optimization Problems
- Bi-criteria and approximation algorithms for restricted matchings
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
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)