{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:38:31Z","timestamp":1720694311780},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0196-6774(82)90022-0","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"225-244","source":"Crossref","is-referenced-by-count":12,"title":["Algorithmic extremal problems in combinatorial optimization"],"prefix":"10.1016","volume":"3","author":[{"given":"Karl J","family":"Lieberherr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90022-0_BIB1","series-title":"Algorithms and Complexity: New Directions and Recent Results","first-page":"41","article-title":"Approximation algorithms for combinatorial problems: An annotated bibliography","author":"Garey","year":"1976"},{"key":"10.1016\/0196-6774(82)90022-0_BIB2","series-title":"Proc. 10th Annual ACM Symposium on Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/0196-6774(82)90022-0_BIB3","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0021-9800(68)80051-1","article-title":"On coloring graphs to maximize the proportion of multicolored k-edges","volume":"5","author":"Erd\u00f6s","year":"1968","journal-title":"J. Combinat. Theory."},{"key":"10.1016\/0196-6774(82)90022-0_BIB4","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0196-6774(82)90022-0_BIB5","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/322248.322260","article-title":"Complexity of partial satisfaction","volume":"28","author":"Lieberherr","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0196-6774(82)90022-0_BIB6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(80)90010-9","article-title":"P-optimal heuristics","volume":"10","author":"Lieberherr","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0196-6774(82)90022-0_BIB7","volume":"vol. 1","author":"Henrici","year":"1974"},{"key":"10.1016\/0196-6774(82)90022-0_BIB8","first-page":"297","article-title":"Note sur les fonctions de M. Sturm","volume":"11","author":"Cayley","year":"1846","journal-title":"J. Math. Pures Appl."},{"key":"10.1016\/0196-6774(82)90022-0_BIB9","doi-asserted-by":"crossref","first-page":"725","DOI":"10.2307\/2318161","article-title":"Computer algebra of polynomials and rational functions","volume":"80","author":"Collins","year":"1973","journal-title":"Am. Math. Mon."},{"key":"10.1016\/0196-6774(82)90022-0_BIB10","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/321662.321667","article-title":"Integer arithmetic algorithms for polynomial real zero determination","volume":"18","author":"Heindel","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(82)90022-0_BIB11","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0196-6774(82)90022-0_BIB12","article-title":"Complexity of partial satisfaction II","author":"Lieberherr","year":"1982"},{"key":"10.1016\/0196-6774(82)90022-0_BIB13","article-title":"Towards an \u03b5-approximation scheme for generalized satisfiability","author":"Huang","year":"1981"},{"key":"10.1016\/0196-6774(82)90022-0_BIB14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF02237816","article-title":"The fastest exact algorithms for the isolation of the real roots of a polynomial equation","volume":"24","author":"Akritas","year":"1980","journal-title":"Computing"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:51:49Z","timestamp":1548726709000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0196677482900220"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90022-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}