Skip to main content
SpringerLink
Log in

The minimum maximal k-partial-matching problem

  • Short Communication
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this paper, we introduce a new problem related to bipartite graphs called minimum maximal k-partial-matching (MMKPM) which has been modelled by using a relaxation of the concept of matching in a graph. The MMKPM problem can be viewed as a generalization of the classical Hitting Set and Set Cover problems. This property has been used to prove that the MMKPM problem is NP-Complete. An integer linear programming formulation and a greedy algorithm have been proposed. The problem can be applied to the design process of finite state machines with input multiplexing for simplifying the complexity of multiplexers.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Asratian A.S., Denley T.M.J., Häggkvist R.: Bipartite Graphs and Their Applications. Cambridge University Press, New York (1998)

    Book  MATH  Google Scholar 

  2. Ausiello G., D’Atri A., Protasi M.: Structure preserving reductions among convex optimization problems. J. Comput. Syst. Sci. 21(1), 136–153 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  3. Garcia-Vargas, I., Senhadji-Navarro, R., Jimenez-Moreno, G., Civit-Balcells, A., Guerra-Gutierrez, P.: Rom-based finite state machine implementation in low cost fpgas. In: IEEE International Symposium on Industrial Electronics, 2007. ISIE 2007, pp. 2342–2347 (2007)

  4. Harvey N.J.A., Ladner R.E., Lovász L., Tamir T.: Semi-matchings for bipartite graphs and load balancing. J. Algorithms 59(1), 53–78 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Karp R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds) Complexity of Computer Computations., pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  6. McElvain, K.: IWLS’93 benchmark set: Version 4.0 (1993)

  7. Senhadji-Navarro R., Garcia-Vargas I., Jimenez-Moreno G., Civit-Ballcels A.: Rom-based fsm implementation using input multiplexing in fpga devices. Electron. Lett. 40(20), 1249–1251 (2004)

    Article  Google Scholar 

  8. Stein, W.: Sage: Open Source Mathematical Software. The Sage Group (2008). http://www.sagemath.org

  9. Gurobi Optimization, Inc.: Gurobi Optimizer Reference Manual. http://www.gurobi.com

Download references

Author information

Authors and Affiliations

  1. Department of Computer Architecture and Technology, University of Seville, Seville, Spain

    Ignacio Garcia-Vargas & Raouf Senhadji-Navarro

Authors
  1. Ignacio Garcia-Vargas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raouf Senhadji-Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ignacio Garcia-Vargas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Garcia-Vargas, I., Senhadji-Navarro, R. The minimum maximal k-partial-matching problem. Optim Lett 7, 1959–1968 (2013). https://doi.org/10.1007/s11590-012-0531-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0531-3

Keywords

Search

Navigation