{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T13:46:27Z","timestamp":1774446387516,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540921844","type":"print"},{"value":"9783540921851","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92185-1_74","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T16:44:33Z","timestamp":1228927473000},"page":"684-695","source":"Crossref","is-referenced-by-count":9,"title":["Approximability and Parameterized Complexity of Minmax Values"],"prefix":"10.1007","author":[{"given":"Kristoffer Arnsfelt","family":"Hansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas Dueholm","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troels Bjerre","family":"S\u00f8rensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"74_CR1","doi-asserted-by":"crossref","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Kalai, A.T., Mirrokni, V., Papadimitriou, C.: The myth of the folk theorem. In: Proceedings of the 40th annual ACM Symposium on Theory of Computing (STOC 2008), pp. 365\u2013372 (2008)","DOI":"10.1145\/1374376.1374429"},{"issue":"3","key":"74_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.tcs.2005.10.002","volume":"351","author":"J.F. Buss","year":"2006","unstructured":"Buss, J.F., Islam, T.: Simplifying the weft hierarchy. Theoretical Computer Science\u00a0351(3), 303\u2013313 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"74_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ic.2005.05.001","volume":"201","author":"J. Chen","year":"2005","unstructured":"Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D.W., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Information and Computation\u00a0201(2), 216\u2013231 (2005)","journal-title":"Information and Computation"},{"key":"74_CR4","unstructured":"Chen, X., Teng, S.-H., Valiant, P.: The approximation complexity of win-lose games. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 159\u2013168 (2007)"},{"issue":"2\u20133","key":"74_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.tcs.2005.02.003","volume":"339","author":"Y. Chen","year":"2005","unstructured":"Chen, Y., Flum, J., Grohe, M.: Machine-based methods in parameterized complexity theory. Theoretical Computer Science\u00a0339(2\u20133), 167\u2013199 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"74_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing\u00a024(4), 873\u2013921 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20132","key":"74_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science\u00a0141(1\u20132), 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"74_CR8","series-title":"Monographs in computer science.","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in computer science. Springer, New York (1999)"},{"key":"74_CR9","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: Faster integer multiplication. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), pp. 57\u201366 (2007)","DOI":"10.1145\/1250790.1250800"},{"key":"74_CR10","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Young, N.E.: Simple strategies for large zero-sum games with applications to complexity theory. In: Proceedings of the 26th annual ACM Symposium on Theory of Computing (STOC 1994), pp. 734\u2013740 (1994)","DOI":"10.1145\/195058.195447"},{"issue":"3","key":"74_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. Journal of Symbolic Computation\u00a013(3), 255\u2013299 (1992)","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"74_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0747-7171(10)80004-5","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part II: The general decision problem. Preliminaries for quantifier elimination. Journal of Symbolic Computation\u00a013(3), 301\u2013327 (1992)","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"74_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0747-7171(10)80005-7","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. part III: Quantifier elimination. Journal of Symbolic Computation\u00a013(3), 329\u2013352 (1992)","journal-title":"Journal of Symbolic Computation"},{"key":"74_CR14","series-title":"Annals of Mathematics Studies 24","first-page":"27","volume-title":"Contributions to the Theory of Games","author":"L.S. Shapley","year":"1950","unstructured":"Shapley, L.S., Snow, R.N.: Basic solutions of discrete games. In: Contributions to the Theory of Games. Annals of Mathematics Studies 24, pp. 27\u201335. Princeton University Press, Princeton (1950)"},{"key":"74_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1006\/game.1997.0527","volume":"21","author":"B. Stengel von","year":"1997","unstructured":"von Stengel, B., Koller, D.: Team-maxmin equilibria. Games and Economic Behavior\u00a021, 309\u2013321 (1997)","journal-title":"Games and Economic Behavior"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92185-1_74","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T04:21:28Z","timestamp":1557980488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92185-1_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921844","9783540921851"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92185-1_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}