{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:45:52Z","timestamp":1778715952193,"version":"3.51.4"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0020-0190(96)00046-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:22:55Z","timestamp":1027624975000},"page":"105-110","source":"Crossref","is-referenced-by-count":29,"title":["Approximability of maximum splitting of k-sets and some other Apx-complete problems"],"prefix":"10.1016","volume":"58","author":[{"given":"Viggo","family":"Kann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Lagergren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00046-4_BIB1","series-title":"Proc. 21st Internat. Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"167","article-title":"Non-oblivious local search for graph and hypergraph coloring problems","volume":"1017","author":"Alimonti","year":"1995"},{"key":"10.1016\/0020-0190(96)00046-4_BIB2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","article-title":"Interior point methods in semidefinite programming with applications to combinatorial optimization","volume":"5","author":"Alizadeh","year":"1995","journal-title":"SIAM J. Optimization"},{"key":"10.1016\/0020-0190(96)00046-4_BIB3","series-title":"Interscience Series in Discrete Mathematics and Optimization","article-title":"The Probabilistic Method","author":"Alon","year":"1991"},{"key":"10.1016\/0020-0190(96)00046-4_BIB4","series-title":"Proc. 36th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"422","article-title":"Free bits, PCPs and non-approximability \u2014 Towards tight results","author":"Bellare","year":"1995"},{"key":"10.1016\/0020-0190(96)00046-4_BIB5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set covering problem","volume":"4","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(96)00046-4_BIB6","series-title":"Proc. 1st Ann. Internat. Conf. on Computing and Combinatorics","first-page":"539","article-title":"Structure in approximation classes","volume":"959","author":"Crescenzi","year":"1995"},{"key":"10.1016\/0020-0190(96)00046-4_BIB7","series-title":"Proc. 26th Ann. ACM Symp. on Theory of Computing","first-page":"422","article-title":"878-approximation algorithms for MAX CUT and MAX 2SAT","author":"Goemans","year":"1994"},{"key":"10.1016\/0020-0190(96)00046-4_BIB8","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","author":"Goemans","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00046-4_BIB9","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. System Sci."},{"key":"10.1016\/0020-0190(96)00046-4_BIB10","series-title":"Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"2","article-title":"Approximate graph coloring by semidefinite programming","author":"Karger","year":"1994"},{"key":"10.1016\/0020-0190(96)00046-4_BIB11","series-title":"Proc. 4th Southeastern Conf. on Combinatorics, Graph Theory, and Computing","first-page":"3","article-title":"Coverings and colorings of hypergraphs","author":"Lov\u00e1sz","year":"1973"},{"key":"10.1016\/0020-0190(96)00046-4_BIB12","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","article-title":"On the hardness of approximating minimization problems","volume":"41","author":"Lund","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00046-4_BIB13","series-title":"Proc. 36th Ann. IEEE Symp. on Foundations of Compute Science","first-page":"162","article-title":"Derandomizing semidefinite programming based approximation algorithms","author":"Mahajan","year":"1995"},{"key":"10.1016\/0020-0190(96)00046-4_BIB14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(96)00046-4_BIB15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01202286","article-title":"The hardness of approximation: Gap location","volume":"4","author":"Petrank","year":"1994","journal-title":"Computational Complexity"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000464?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000464?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:52:29Z","timestamp":1555959149000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0020019096000464"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00046-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}