{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T23:55:44Z","timestamp":1648684544251},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s10878-005-1413-8","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T20:57:18Z","timestamp":1119992238000},"page":"295-311","source":"Crossref","is-referenced-by-count":2,"title":["On the Hardness of Approximating the Min-Hack Problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Ramkumar","family":"Chinchani","sequence":"first","affiliation":[]},{"given":"Duc","family":"Ha","sequence":"additional","affiliation":[]},{"given":"Anusha","family":"Iyer","sequence":"additional","affiliation":[]},{"given":"Hung Q.","family":"Ngo","sequence":"additional","affiliation":[]},{"given":"Shambhu","family":"Upadhyaya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1413_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.2307\/2694916","volume":"66","author":"M. Alekhnovich","year":"2001","unstructured":"M. Alekhnovich, S. Buss, S. Moran, and T. Pitassi, \u201cMinimum propositional proof length is NP-hard to linearly approximate,\u201d J. Symbolic Logic, vol. 66, pp. 171\u2013191, 2001.","journal-title":"J. Symbolic Logic"},{"key":"1413_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora, L. Babai, J. Stern, and Z. Sweedyk, \u201cThe hardness of approximate optima in lattices, codes, and systems of linear equations,\u201d J. Comput. System Sci., vol. 54, pp. 317\u2013331, 1997. 34th Annual Symposium on Foundations of Computer Science (Palo Alto, CA, 1993).","DOI":"10.1006\/jcss.1997.1472"},{"key":"1413_CR3","unstructured":"S. Arora and C. Lund, \u201cHardness of approximation,\u201d in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, (ed.), PWS Publishing Company, 1997, pp. 399\u2013346."},{"key":"1413_CR4","doi-asserted-by":"crossref","unstructured":"R. Chinchani, A. Iyer, H.Q. Ngo, and S. Upadhyaya, \u201cTowards a theory of insider threat assessment,\u201d in Proceedings of the International Conference on Dependable Systems and Networks (DSN 2005, Yokohama, Japan), IEEE, 2005.","DOI":"10.1109\/DSN.2005.94"},{"key":"1413_CR5","doi-asserted-by":"crossref","first-page":"1759","DOI":"10.1137\/S0097539796304220","volume":"28","author":"P. Crescenzi","year":"1999","unstructured":"P. Crescenzi, V. Kann, R. Silvestri, and L. Trevisan, \u201cStructure in approximation classes,\u201d SIAM J. Comput., vol. 28, pp. 1759\u20131782, 1999 (electronic).","journal-title":"SIAM J. Comput."},{"key":"1413_CR6","doi-asserted-by":"crossref","unstructured":"I. Dinur, E. Fischer, G. Kindler, R. Raz, and S. Safra, \u201cPCP characterizations of NP: Towards a polynomially-small error-probability,\u201d in Annual ACM Symposium on Theory of Computing Atlanta, GA, ACM: New York, 1999, pp. 29\u201340 (electronic).","DOI":"10.1145\/301250.301265"},{"key":"1413_CR7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ipl.2003.11.007","volume":"89","author":"I. Dinur","year":"2004","unstructured":"I. Dinur and S. Safra, \u201cOn the hardness of approximating label-cover,\u201d Inform. Process. Lett., vol. 89, pp. 247\u2013254, 2004.","journal-title":"Inform. Process. Lett."},{"key":"1413_CR8","volume-title":"Approximation Algorithms for NP Hard Problems","year":"1997","unstructured":"D.S. Hochbaum (ed.), Approximation Algorithms for NP Hard Problems, PWS Publishing Company: Boston, MA, 1997."},{"key":"1413_CR9","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"C. Lund and M. Yannakakis, \u201cOn the hardness of approximating minimization problems,\u201d J. Assoc. Comput. Mach., vol. 41, pp. 960\u2013981, 1994.","journal-title":"J. Assoc. Comput. Mach."},{"key":"1413_CR10","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"C.H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company: Reading, MA, 1994."},{"key":"1413_CR11","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"V.V. Vazirani, Approximation Algorithms, Springer-Verlag: Berlin, 2001."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1413-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-1413-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1413-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:08Z","timestamp":1559276288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-1413-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["1413"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-1413-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}