Budgeted colored matching problems

DOI10.1016/j.endm.2018.01.026zbMath1388.90116OpenAlexW2794327730MaRDI QIDQ1742233

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

zbMATH Keywords

complexitybudgeted optimizationbudgeted matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Minimum <scp>color‐degree</scp> perfect b‐matchings

Cites Work

• Unnamed Item
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Paths, trees and matchings under disjunctive constraints
• Exact arborescences, matchings and cycles
• Utilitarian Mechanism Design for Multiobjective Optimization
• Approximation Schemes for Multi-Budgeted Independence Systems
• The Recognition of Series Parallel Digraphs
• Random pseudo-polynomial algorithms for exact matroid problems
• Some Matching Problems for Bipartite Graphs
• The budgeted minimum cost flow problem with unit upgrading cost

This page was built for publication: Budgeted colored matching problems