View in EDS

An upper bound for the minimum number of queens covering the n×n chessboard

Saved in:
Bibliographic Details
Title: An upper bound for the minimum number of queens covering the n×n chessboard
Authors: Burger, A.P.1, Mynhardt, C.M.1 mynhacm@hotmail.com
Source: Discrete Applied Mathematics. Sep2002, Vol. 121 Issue 1-3, p51. 10p.
Subjects: Dominating set, Chess problems
Abstract: We show that the minimum number of queens required to cover the n×n chessboard is at most 8/15n+O(1). [Copyright &y& Elsevier]
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 7807391
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: An upper bound for the minimum number of queens covering the <f>n×n</f> chessboard
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Burger%2C+A%2EP%2E%22">Burger, A.P.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Mynhardt%2C+C%2EM%2E%22">Mynhardt, C.M.</searchLink><relatesTo>1</relatesTo><i> mynhacm@hotmail.com</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Discrete+Applied+Mathematics%22">Discrete Applied Mathematics</searchLink>. Sep2002, Vol. 121 Issue 1-3, p51. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Dominating+set%22">Dominating set</searchLink><br /><searchLink fieldCode="DE" term="%22Chess+problems%22">Chess problems</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We show that the minimum number of queens required to cover the <f>n×n</f> chessboard is at most <f><NU>8</NU>/15n+O(1)</f>. [Copyright &y& Elsevier]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=7807391
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/S0166-218X(01)00244-X
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 51
    Subjects:
      – SubjectFull: Dominating set
        Type: general
      – SubjectFull: Chess problems
        Type: general
    Titles:
      – TitleFull: An upper bound for the minimum number of queens covering the <f>n×n</f> chessboard
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Burger, A.P.
      – PersonEntity:
          Name:
            NameFull: Mynhardt, C.M.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 09
              Text: Sep2002
              Type: published
              Y: 2002
          Identifiers:
            – Type: issn-print
              Value: 0166218X
          Numbering:
            – Type: volume
              Value: 121
            – Type: issue
              Value: 1-3
          Titles:
            – TitleFull: Discrete Applied Mathematics
              Type: main
ResultId 1