{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T08:11:51Z","timestamp":1709367111640},"reference-count":7,"publisher":"Association for Computing Machinery (ACM)","issue":"4","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCSE Bull."],"published-print":{"date-parts":[[2004,12]]},"abstract":"One of the programming problems in the 2002 Pacific Northwest regional ACM ICPC contest provides a new way to teach backtracking and also provides a very powerful example of a forward-looking bounding function. This article presents the problem, the bounding function, and timing information of implementations with and without the bounding function. It also provides the URL for access to the programs themselves.<\/jats:p>","DOI":"10.1145\/1041624.1041664","type":"journal-article","created":{"date-parts":[[2005,1,26]],"date-time":"2005-01-26T16:49:14Z","timestamp":1106758154000},"page":"83-84","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An alternative problem for backtracking and bounding"],"prefix":"10.1145","volume":"36","author":[{"given":"Timothy J.","family":"Rolfe","sequence":"first","affiliation":[{"name":"Eastern Washington University, Cheney, Washington"}]},{"given":"Paul W.","family":"Purdom","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, Bloomington, Indiana"}]}],"member":"320","published-online":{"date-parts":[[2004,6,28]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Dean S. Clark \"A Combinatorial Theorem on Circulant Matrices\" Amer. Math. Monthly Vol. 92 No. 10 (December 1985) pp. 725 ff. For those whose institutions are participants in JSTOR (Journal STORage) http:\/\/www.jstor.org\/browse\/#Mathematics provides access to this article --- select American Mathematical Monthly navigate to Vol. 92 No. 10 and search for \"Clark\". He later coauthored a paper on n-entry circular permutations. Dean S. Clark and Stanford S. Bonan \"Experimental Gambling System\" Mathematics Magazine Vol. 60 No. 4 (October 1987) pp. 217 ff. Again http:\/\/www.jstor.org\/browse\/#Mathematics provides access --- select Mathematics Magazine navigate to Vol. 60 No. 4 then search for \"Clark\". Dean S. Clark \"A Combinatorial Theorem on Circulant Matrices\" Amer. Math. Monthly Vol. 92 No. 10 (December 1985) pp. 725 ff. For those whose institutions are participants in JSTOR (Journal STORage) http:\/\/www.jstor.org\/browse\/#Mathematics provides access to this article --- select American Mathematical Monthly navigate to Vol. 92 No. 10 and search for \"Clark\". He later coauthored a paper on n-entry circular permutations. Dean S. Clark and Stanford S. Bonan \"Experimental Gambling System\" Mathematics Magazine Vol. 60 No. 4 (October 1987) pp. 217 ff. Again http:\/\/www.jstor.org\/browse\/#Mathematics provides access --- select Mathematics Magazine navigate to Vol. 60 No. 4 then search for \"Clark\"."},{"key":"e_1_2_1_2_1","volume-title":"August","author":"Martin Gardner","year":"1986"},{"issue":"2","key":"e_1_2_1_3_1","first-page":"98","volume":"21","author":"Timothy J.","year":"1987","journal-title":"Mathematics and Computer Education"},{"key":"e_1_2_1_4_1","unstructured":"See Problem E in http:\/\/www.acmcontest-pacnw.org\/ProblemSet\/2002\/forweb.zip See Problem E in http:\/\/www.acmcontest-pacnw.org\/ProblemSet\/2002\/forweb.zip"},{"key":"e_1_2_1_5_1","unstructured":"See http:\/\/icpc.baylor.edu\/icpc\/ See http:\/\/icpc.baylor.edu\/icpc\/"},{"issue":"5","key":"e_1_2_1_6_1","first-page":"48","volume":"29","author":"Timothy Rolfe","year":"2004","journal-title":"Dr. Dobb's Journal"},{"key":"e_1_2_1_7_1","unstructured":"These implementations (which were developed as the instructor's solution when the problem was given as an assignment in an Algorithms course) are available through the following URL: http:\/\/penguin.ewu.edu\/~trolfe\/BoundClock\/Implementation.html These implementations (which were developed as the instructor's solution when the problem was given as an assignment in an Algorithms course) are available through the following URL: http:\/\/penguin.ewu.edu\/~trolfe\/BoundClock\/Implementation.html"}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1041624.1041664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T20:19:11Z","timestamp":1693858751000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1041624.1041664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6,28]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1145\/1041624.1041664"],"URL":"https:\/\/doi.org\/10.1145\/1041624.1041664","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1044550.1041664","asserted-by":"subject"}]},"ISSN":["0097-8418"],"issn-type":[{"value":"0097-8418","type":"print"}],"subject":[],"published":{"date-parts":[[2004,6,28]]},"assertion":[{"value":"2004-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}