The minimum maximal k-partial-matching problem

DOI10.1007/S11590-012-0531-3zbMATH Open1287.90082OpenAlexW1987110199MaRDI QIDQ395867FDOQ395867

Authors: Ignacio Garcia-Vargas, Raouf Senhadji-Navarro 

Publication date: 30 January 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/90799

Recommendations

• Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
• On the complexity of a family of generalized matching problems
• Algorithms and Computation
• On complexity of special maximum matchings constructing
• Simultaneous matchings: Hardness and approximation

zbMATH Keywords

bipartite graphNP-completenessset coverfinite state machinehitting setpartial-matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites Work

• Structure preserving reductions among convex optimization problems
• Title not available (Why is that?)
• Semi-matchings for bipartite graphs and load balancing

Cited In (4)

• A Min-Max Theorem for a Constrained Matching Problem
• Title not available (Why is that?)
• Approximating the Maximum Sharing Problem
• Equivalence between the minimum covering problem and the maximum matching problem

Uses Software

• SageMath
• Gurobi

This page was built for publication: The minimum maximal k-partial-matching problem

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