{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T02:15:00Z","timestamp":1762222500579,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6772,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0304-3975(94)00165-f","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"145-157","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["\u03b5-approximations of k-label spaces"],"prefix":"10.1016","volume":"137","author":[{"given":"Susumu","family":"Hasegawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaki","family":"Ishiguro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00165-F_BIB1","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and Vapnik Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"year":"1987","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","key":"10.1016\/0304-3975(94)00165-F_BIB2"},{"article-title":"A study on \u03b5-net and \u03b5-approximation","year":"1993","author":"Hasegawa","key":"10.1016\/0304-3975(94)00165-F_BIB3"},{"article-title":"A generalization of Sauer's Lemma","year":"1991","author":"Haussler","key":"10.1016\/0304-3975(94)00165-F_BIB4"},{"key":"10.1016\/0304-3975(94)00165-F_BIB5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","article-title":"Epsilon-nets and simplex range queries","volume":"2","author":"Haussler","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0304-3975(94)00165-F_BIB6","series-title":"Proc. 10th ACM Ann. Symp. on Computational Geometry","first-page":"332","article-title":"Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering","author":"Inaba","year":"1994"},{"article-title":"Evaluation of combinatorial complexity for hypothesis spaces in learning theory with applications","year":"1994","author":"Ishiguro","key":"10.1016\/0304-3975(94)00165-F_BIB7"},{"key":"10.1016\/0304-3975(94)00165-F_BIB8","series-title":"Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science","first-page":"424","article-title":"Discrepancy and \u03b5-approximations for bounded VC-dimension","author":"Matou\u0161ek","year":"1991"},{"article-title":"Lecture Notes on Randomized Algorithms","year":"1990","author":"Raghavan","key":"10.1016\/0304-3975(94)00165-F_BIB9"},{"key":"10.1016\/0304-3975(94)00165-F_BIB10","series-title":"Proc. 7th ACM Ann. Symp. on Computational Geometry","first-page":"262","article-title":"Geometric algorithms on an assignment problem","author":"Tokuyama","year":"1991"},{"key":"10.1016\/0304-3975(94)00165-F_BIB11","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400165F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400165F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T02:08:32Z","timestamp":1762222112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400165F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["030439759400165F"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00165-f","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1995,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"\u03b5-approximations of k-label spaces","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)00165-F","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}