Budgeted colored matching problems
From MaRDI portal
Publication:1742233
DOI10.1016/J.ENDM.2018.01.026zbMATH Open1388.90116OpenAlexW2794327730WikidataQ130202729 ScholiaQ130202729MaRDI QIDQ1742233FDOQ1742233
Authors: Christina Büsing, Martin Comis 
Publication date: 11 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2018.01.026
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
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The Recognition of Series Parallel Digraphs
- Some Matching Problems for Bipartite Graphs
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Approximation Schemes for Multi-Budgeted Independence Systems
- Paths, trees and matchings under disjunctive constraints
- Exact arborescences, matchings and cycles
- Random pseudo-polynomial algorithms for exact matroid problems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Utilitarian mechanism design for multiobjective optimization
- The budgeted minimum cost flow problem with unit upgrading cost
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)
