Pages that link to "Item:Q3586491"
From MaRDI portal
The following pages link to Approximation Schemes for Multi-Budgeted Independence Systems (Q3586491):
Displaying 8 items.
- Matroid and knapsack center problems (Q300451) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Budgeted colored matching problems (Q1742233) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility Under Budget Constraints (Q5245021) (← links)
- An FPTAS for budgeted laminar matroid independent set (Q6556192) (← links)
- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs (Q6657247) (← links)