Approximability of Latin square completion-type puzzles

Kazuya Haraguchi, Hirotaka Ono

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

3 被引用数 (Scopus)

抄録

Among many variations of pencil puzzles, Latin square Completion-Type puzzles (LSCP), such as Sudoku, Futoshiki and BlockSum, are quite popular for puzzle fans. Concerning these puzzles, the solvability has been investigated from the viewpoint of time complexity in the last decade; it has been shown that, in most of these puzzles, it is NP-complete to determine whether a given puzzle instance has a proper solution. In this paper, we investigate the approximability of LSCP. We formulate LSCP as the maximization problem that asks to fill as many cells as possible, under the Latin square condition and the inherent condition. We then propose simple generic approximation algorithms for LSCP and analyze their approximation ratios.

本文言語英語
ホスト出版物のタイトルFun with Algorithms - 7th International Conference, FUN 2014, Proceedings
出版社Springer Verlag
ページ218-229
ページ数12
ISBN(印刷版)9783319078892
DOI
出版ステータス出版済み - 2014
イベント7th International Conference on Fun with Algorithms, FUN 2014 - Sicily, イタリア
継続期間: 7 1 20147 3 2014

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8496 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他7th International Conference on Fun with Algorithms, FUN 2014
Countryイタリア
CitySicily
Period7/1/147/3/14

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Approximability of Latin square completion-type puzzles」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル