Matchings in colored bipartite networks

DOI10.1016/S0166-218X(01)00300-6zbMath1020.90041OpenAlexW2039568698MaRDI QIDQ1613406

Cosimo Spera, Tongnyoul Yi, Katta G. Murty

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00300-6

zbMATH Keywords

assignment problem\(0-1\) cost matrixextreme point with specified objective value

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms ⋮ Integrality gaps for colorful matchings ⋮ The Complexity of Bottleneck Labeled Graph Problems ⋮ On generalized balanced optimization problems ⋮ Nonlinear bipartite matching ⋮ Bicolored matchings in some classes of graphs ⋮ Bicolored matchings in some classes of graphs ⋮ Random bichromatic matchings ⋮ The complexity of bottleneck labeled graph problems ⋮ The labeled perfect matching in bipartite graphs ⋮ Using graphs for some discrete tomography problems

Cites Work

• Unnamed Item
• Some NP-complete problems in linear programming
• Maximum matching of given weight in complete and complete bipartite graphs
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Matchings in colored bipartite networks