{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:24:06Z","timestamp":1725470646229},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540390985"},{"type":"electronic","value":"9783540391012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_4","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T15:43:02Z","timestamp":1158162182000},"page":"38-49","source":"Crossref","is-referenced-by-count":7,"title":["Parameterizing MAX SNP Problems Above Guaranteed Values"],"prefix":"10.1007","author":[{"given":"Meena","family":"Mahajan","sequence":"first","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1006\/jcss.1997.1490","volume":"54","author":"L. Cai","year":"1997","unstructured":"Cai, L., Chen, J.: On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. Jour. Comput. Sys. Sci.\u00a054(3), 465\u2013474 (1997)","journal-title":"Jour. Comput. Sys. Sci."},{"key":"4_CR2","unstructured":"Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The Linear Arrangement Problem Parameterized Above Guaranteed Value, Available at: \n                  \n                    http:\/\/arxiv.org\/abs\/cs.DS\/0511030"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Venkatesh, S.: On the Advantage Over a Random Assignment. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 43\u201352 (2002)","DOI":"10.1145\/509907.509916"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Khanna, S., Motwani, R., Sudan, M., Vazirani, U.: On Syntactic Versus Computational Views of Approximability. SIAM Jour. Computing 28(1), 164\u2013191","DOI":"10.1137\/S0097539795286612"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above Guaranteed Values: MaxSat and MaxCut. Journal of Algorithms\u00a031, 335\u2013354 (1999)","journal-title":"Journal of Algorithms"},{"key":"4_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"4_CR7","first-page":"425","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, Approximation, and Complexity Classes. JCSS\u00a043, 425\u2013440 (1991)","journal-title":"JCSS"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"519","DOI":"10.4153\/CJM-1982-036-8","volume":"34","author":"S. Poljak","year":"1982","unstructured":"Poljak, S., Turz\u00edk, D.: A Polynomial Algorithm for Constructing a Large Bipartite Subgraph with an Application to a Satisfiability Problem. Canadian Jour. Math.\u00a034(3), 519\u2013524 (1982)","journal-title":"Canadian Jour. Math."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/jagm.2000.1075","volume":"36","author":"P. Rossmanith","year":"2000","unstructured":"Rossmanith, P., Niedermeier, R.: New Upper Bounds for Maximum Satisfiability. Journal of Algorithms\u00a036, 63\u201388 (2000)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:18:46Z","timestamp":1619507926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11847250_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}