Constrained matching problems in bipartite graphs

DOI10.1007/978-3-642-32147-4_31MaRDI QIDQ3167638zbMATH OpenOpenAlexFDO

Authors Monaldo Mastrolilli, Georgios Stamoulis

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32147-4_31

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Integer programming (90C10) Multi-objective and goal programming (90C29)

Recommendations

• Bi-criteria and approximation algorithms for restricted matchings
• Approximate constrained bipartite edge coloring
• scientific article; zbMATH DE number 2044917
• Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
• Constrained bipartite edge coloring with applications to wavelength routing

Cited in

(28)

• The uniquely solvable bipartite matching problem
• Adjacency on the constrained assignment problem
• A polyhedral approach for a constrained matching problem
• A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
• Approximation algorithms for NMR spectral peak assignment.
• Isomorphic unordered labeled trees up to substitution ciphering
• Matchings under distance constraints. I
• On tree-constrained matchings and generalizations
• Bi-criteria and approximation algorithms for restricted matchings
• Maximum weight edge-constrained matchings
• Optimal edge-coloring with edge rate constraints
• On tree-constrained matchings and generalizations
• Dynamic Matchings in Left Weighted Convex Bipartite Graphs
• Randomized and Approximation Algorithms for Blue-Red Matching
• scientific article; zbMATH DE number 4033793 (Why is no real title available?)
• A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
• scientific article; zbMATH DE number 1945156 (Why is no real title available?)
• Constrained bipartite edge coloring with applications to wavelength routing
• Bi-objective matchings with the triangle inequality
• On the maximum edge-pair embedding bipartite matching
• Algorithms and Computation
• On the maximum edge-pair embedding bipartite matching
• Minimum <scp>color‐degree</scp> perfect b‐matchings
• Matchings under distance constraints. II.
• On the exact matching problem in dense graphs
• Exact matching: correct parity and FPT parameterized by independence number
• On-line maximum matching in complete multi-partite graphs with an application to optical networks
• Nonlinear bipartite matching

This page was built for publication: Constrained matching problems in bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167638)