Advertisement

A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively

  • Kazuya Haraguchi
Chapter
Part of the Studies in Computational Intelligence book series (SCI, volume 580)

Abstract

A partial Latin square (PLS) is a partial assignment of \(n\) symbols to an \(n\times n\) grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension (PLSE) problem asks to find such a PLS that is a maximum extension of a given PLS. Recently Haraguchi et al. proposed a heuristic algorithm for the PLSE problem. In this paper, we present its effectiveness especially for the “hardest” instances. We show by empirical studies that, when \(n\) is large to some extent, the instances such that symbols are given in 60–70 % of the \(n^2\) cells are the hardest. For such instances, the algorithm delivers a better solution quickly than IBM ILOG CPLEX, a state-of-the-art optimization solver, that is given a longer time limit. It also outperforms surrogate constraint based heuristics that are originally developed for the maximum independent set problem.

Keywords

Partial Latin square extension problem Heuristic Constructive algorithm Maximum matching Maximum independent set problem 

References

  1. 1.
    Colbourn, C.J.: The complexity of completing partial Latin squares. Discrete Appl. Math. 8, 25–30 (1984)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Barry, R.A., Humblet, P.A.: Latin routers, design and implementation. IEEE/OSA J. Lightwave Technol. 11(5), 891–899 (1993)CrossRefGoogle Scholar
  3. 3.
    Gomes, C.P., Shmoys, D.: Completing quasigroups or Latin squares: a structured graph coloring problem. In: Proc. Computational Symposium on Graph Coloring and Generalizations (2002)Google Scholar
  4. 4.
    Kumar, R., Russel, A., Sundaram, R.: Approximating latin square extensions. Algorithmica 24(2), 128–138 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Haraguchi, K., Ishigaki, M., Maruoka, A.: A maximum matching based heuristic algorithm for partial latin square extension problem. In: Proc. FedCSIS 2013, 347–354 (2013)Google Scholar
  6. 6.
  7. 7.
    Glover, F.: Tutorial on surrogate constraint approaches for optimization in graphs. J. Heuristics 9, 175–227 (2003)CrossRefzbMATHGoogle Scholar
  8. 8.
    Alidaee, B., Kochenberger, G., Wang, H.: Simple and fast surrogate constraint heuristics for the maximum independent set problem. J. Heuristics 14, 571–585 (2008)CrossRefGoogle Scholar
  9. 9.
    Hopcroft, J.E., Karp, R.M.: An \(n^{5/2}\) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225–231 (1973)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Cymer, R.: Dulmage-Mendelsohn canonical decomposition as a generic pruning technique. Constraints 17, 234–272 (2012)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Company, New York (1979)Google Scholar
  12. 12.
    Barták, R.: On generators of random quasigroup problems. In: Proc. CSCLP 2005, 164–178 (2006)Google Scholar
  13. 13.
    Gomes, G., Selman, B.: Problem structure in the presence of perturbations. In: Proc. AAAI 97, pp. 221–227 (1997)Google Scholar
  14. 14.
    Shaw, P., Stergiou, K., Walsh, T.: Arc consistency and quasigroup completion. In: Proc. ECAI-98 (workshop on binary constraints) (1998)Google Scholar
  15. 15.
    Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity from characteristic phase transitions. Nature 400, 133–137 (1999)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Ansotegui, C., Bejar, R., Fernandez, C., Mateu, C.: On the hardness of solving edge matching puzzles as sat or csp problems. Constraints 18, 7–37 (2013)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Appa, G., Magos, D., Mourtos, I.: Searching for mutually orthogonal Latin squares via integer and constraint programming. Eur. J. Oper. Res. 173(2), 519–530 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Fontaine, D., Michel, L.: A high level language for solver independent model manipulation and generation of hybrid solvers. In: Proc. CPAIOR 2012, pp. 180–194 (2012)Google Scholar
  19. 19.
    Andrade, D., Resende, M., Werneck, R.: Fast local search for the maximum independent set problem. J. Heuristics 18, 525–547 (2012)CrossRefGoogle Scholar
  20. 20.
  21. 21.
    Hajirasouliha, I., Jowhari, H., Kumar, R., Sundaram, R.: On completing Latin squares. In: Proc. STACS 2007, pp. 524–535Google Scholar
  22. 22.
    Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discrete Math. 2(1), 68–72 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  23. 23.
    Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. arXiv preprint arXiv:1304.1424 (2013)

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Faculty of CommerceOtaru University of CommerceOtaruJapan

Personalised recommendations