Budgeted colored matching problems
From MaRDI portal
Recommendations
- On some matching problems under the color-spanning model
- Optimization problems with color-induced budget constraints
- Optimization problems with color-induced budget constraints
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
- Color constrained combinatorial optimization problems
- Multi-budgeted matching problems
- On the fixed-parameter tractability of some matching problems under the color-spanning model
- The Budgeted Unique Coverage Problem and Color-Coding
- Structural parameterizations of budgeted graph coloring
- Structural parameterizations of budgeted graph coloring
Cites work
- Approximation Schemes for Multi-Budgeted Independence Systems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Exact arborescences, matchings and cycles
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Paths, trees and matchings under disjunctive constraints
- Random pseudo-polynomial algorithms for exact matroid problems
- Some Matching Problems for Bipartite Graphs
- The Recognition of Series Parallel Digraphs
- The budgeted minimum cost flow problem with unit upgrading cost
- Utilitarian mechanism design for multiobjective optimization
Cited in
(4)
This page was built for publication: Budgeted colored matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742233)