{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T01:29:46Z","timestamp":1773365386419,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540401766","type":"print"},{"value":"9783540448495","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_21","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:26:17Z","timestamp":1186741577000},"page":"152-164","source":"Crossref","is-referenced-by-count":27,"title":["Approximation Hardness for Small Occurrence Instances of NP-Hard Problems"],"prefix":"10.1007","author":[{"given":"Miroslav","family":"Chleb\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janka","family":"Chleb\u00edkov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"21_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/3-540-60220-8_84","volume-title":"Proc. 4th Workshop on Algorithms and Data Structures","author":"P. Berman","year":"1995","unstructured":"P. Berman and T. Fujito: Approximating independent sets in degree 3 graphs, Proc. 4th Workshop on Algorithms and Data Structures, 1995, Springer-Verlag, Berlin, LNCS 955, 449\u2013460."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"P. Berman and M. Karpinski: On some tighter inapproximability results, further improvements, ECCC, Report No. 65, 1998.","DOI":"10.1007\/3-540-48523-6_17"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-48224-5_17","volume-title":"Proceedings of 28th ICALP, 2001","author":"L. Engebretsen","year":"2001","unstructured":"L. Engebretsen and M. Karpinski: Approximation hardness of TSP with bounded metrics, Proceedings of 28th ICALP, 2001, LNCS 2076, 201\u2013212."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"J. H\u00e5stad: Some optimal inapproximability results, Journal of ACM 48 (2001), 798\u2013859.","journal-title":"Journal of ACM"},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-61310-2_10","volume-title":"Proc. 5th International Conference on Integer Programming and Combinatorial Optimization","author":"M. M. Halld\u00f3rsson","year":"1996","unstructured":"M. M. Halld\u00f3rsson: Approximating k-set cover and complementary graph coloring, Proc. 5th International Conference on Integer Programming and Combinatorial Optimization, 1996, Springer-Verlag, Berlin, LNCS 1084, 118\u2013131."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C. A. J. Hurkens","year":"1989","unstructured":"C. A. J. Hurkens and A. Schrijver: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Mathematics 2 (1989), 68\u201372.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-45471-3_18","volume-title":"Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT","author":"M. Chleb\u00edk","year":"2002","unstructured":"M. Chleb\u00edk and J. Chleb\u00edkov\u00e1: Approximation Hardness of the Steiner Tree Problem on Graphs, Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, Springer, LNCS 2368, 170\u2013179."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"M. Chleb\u00edk and J. Chleb\u00edkov\u00e1: Approximation Hardness for Small Occurrence Instances of NP-Hard Problems, ECCC, Report No. 73, 2002.","DOI":"10.1007\/3-540-44849-7_21"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"V. Kann: Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters 37 (1991), 27\u201335.","journal-title":"Information Processing Letters"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C. H. Papadimitriou","year":"1991","unstructured":"C. H. Papadimitriou and M. Yannakakis: Optimization, approximation, and complexity classes, J. Computer and System Sciences 43 (1991), 425\u2013440.","journal-title":"J. Computer and System Sciences"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou and S. Vempala: On the Approximability of the Traveling Salesman Problem, Proceedings of the 32nd ACM Symposium on the theory of computing, Portland, 2000.","DOI":"10.1145\/335305.335320"},{"key":"21_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1007\/3-540-44683-4_59","volume-title":"Proceedings of the 26th International Symposium, MFCS","author":"M. Thimm","year":"2001","unstructured":"M. Thimm: On the Approximability of the Steiner Tree Problem, Proceedings of the 26th International Symposium, MFCS 2001, Springer, LNCS 2136, 678\u2013689."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:12:27Z","timestamp":1556748747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}