{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:39:17Z","timestamp":1725496757383},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402053"},{"type":"electronic","value":"9783540448679"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44867-5_17","type":"book-chapter","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T06:34:45Z","timestamp":1196404485000},"page":"209-222","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Core Instances for Testing: A Case Study"],"prefix":"10.1007","author":[{"given":"Monaldo","family":"Mastrolilli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonora","family":"Bianchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R. Barr","year":"1995","unstructured":"R. Barr, B. Golden, J. Kelly, M. Resende, and W. S. Jr. Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1:9\u201332, 1995.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L. Berman","year":"1977","unstructured":"L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing, 6(2):305\u2013322, June 1977.","journal-title":"SIAM Journal on Computing"},{"issue":"47","key":"17_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(97)00164-6","volume":"64","author":"M. Cesati","year":"1997","unstructured":"M. Cesati and L. Trevisan. On the efficiency of polynomial time approximation schemes. Information Processing Letters, 64(47):165\u2013171, 1997.","journal-title":"Information Processing Letters"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"R. Downey and M. Fellows. Parameterized Complexity. Springer, 1998.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"17_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-44676-1_17","volume-title":"9th Annual European Symposium on Algorithms (ESA\u201901)","author":"A. Fishkin","year":"2001","unstructured":"A. Fishkin, K. Jansen, and M. Mastrolilli. Grouping techniques for scheduling problems: simpler and faster. In 9th Annual European Symposium on Algorithms (ESA\u201901), volume LNCS 2161, pages 206\u2013217, 2001."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. Graham","year":"1979","unstructured":"R. Graham, E. Lawler, J. Lenstra, and A. R. Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of Discrete Mathematics, volume 5, pages 287\u2013326. North-Holland, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/ijoc.2.1.94","volume":"2","author":"H. Greenberg","year":"1990","unstructured":"H. Greenberg. Computational testing: why, how and how much. ORSA Journal of Computing, 2:94\u201397, 1990.","journal-title":"ORSA Journal of Computing"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"L. Hall and D. Shmoys. Approximation algorithms for constrained scheduling problems. In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 134\u2013139, 1989.","DOI":"10.1109\/SFCS.1989.63468"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1287\/opre.42.2.201","volume":"42","author":"J. Hooker","year":"1994","unstructured":"J. Hooker. Needed: An empirical science of algorithms. Operations Research, 42:201\u2013212, 1994.","journal-title":"Operations Research"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J. Hooker","year":"1995","unstructured":"J. Hooker. Testing heuristics: We have it all wrong. Journal of Heuristics, 1:33\u201342, 1995.","journal-title":"Journal of Heuristics"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"D. Johnson. A theoretician\u2019s guide to the experimental analysis of algorithms. In G. Johnson and McGeoch, editors, to appear in Proceedings of the 5th and 6th DIMACS Implementation Challenges. American Mathematical Society, 2002.","DOI":"10.1090\/dimacs\/059\/11"},{"key":"17_CR12","first-page":"343","volume":"1","author":"J. Lenstra","year":"1977","unstructured":"J. Lenstra, A. R. Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Operations Research, 1:343\u2013362, 1977.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","volume":"25","author":"S. Mahaney","year":"1982","unstructured":"S. Mahaney. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences, 25(2):130\u2013143, Oct. 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-45294-X_23","volume-title":"Proceedings of the 21st Foundations of Software Technology and Theoretical Computer Science","author":"M. Mastrolilli","year":"2001","unstructured":"M. Mastrolilli. Grouping techniques for one machine scheduling subject to precedence constraints. In Proceedings of the 21st Foundations of Software Technology and Theoretical Computer Science, volume LNCS 2245, pages 268\u2013279, 2001."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.8.1.1","volume":"8","author":"C. McGeoch","year":"1996","unstructured":"C. McGeoch. Toward an experimental method for algorithm simulation. INFORMS Journal of Computing, 8:1\u201315, 1996.","journal-title":"INFORMS Journal of Computing"},{"key":"17_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995."},{"key":"17_CR17","unstructured":"P. Schuurman and G. Woeginger. Approximation schemes \u2014 a tutorial. Technical report, 2001."}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44867-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T01:05:43Z","timestamp":1684112743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44867-5_17"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402053","9783540448679"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44867-5_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}