Virginia Tech
    • Log in
    View Item 
    •   VTechWorks Home
    • College of Engineering (COE)
    • Department of Computer Science
    • Computer Science Technical Reports
    • View Item
    •   VTechWorks Home
    • College of Engineering (COE)
    • Department of Computer Science
    • Computer Science Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Covering a Set with Arithmetic Progressions is NP-Complete

    Thumbnail
    View/Open
    TR-89-25.pdf (431.5Kb)
    Downloads: 453
    TR number
    TR-89-25
    Date
    1989
    Author
    Heath, Lenwood S.
    Metadata
    Show full item record
    Abstract
    This paper defines a new class of set covering problems in which the subsets are implicitly derived from the properties of the set elements. In particular, the set elements are integers and the subsets are finite arithmetic progressions. Both minimum cover and exact cover problems are defined. Both problems are shown to be NP-Complete.
    URI
    http://hdl.handle.net/10919/19566
    Collections
    • Computer Science Technical Reports [1035]

    If you believe that any material in VTechWorks should be removed, please see our policy and procedure for Requesting that Material be Amended or Removed. All takedown requests will be promptly acknowledged and investigated.

    Virginia Tech | University Libraries | Contact Us
     

     

    VTechWorks

    AboutPoliciesHelp

    Browse

    All of VTechWorksCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Log inRegister

    Statistics

    View Usage Statistics

    If you believe that any material in VTechWorks should be removed, please see our policy and procedure for Requesting that Material be Amended or Removed. All takedown requests will be promptly acknowledged and investigated.

    Virginia Tech | University Libraries | Contact Us