{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:29:21Z","timestamp":1742956161820,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030181253"},{"type":"electronic","value":"9783030181260"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18126-0_12","type":"book-chapter","created":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:02:19Z","timestamp":1555282939000},"page":"133-143","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Inapproximability of k-DominatingSet for Parameterized $$\\mathsf {{AC}^0}$$ Circuits"],"prefix":"10.1007","author":[{"given":"Wenxing","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,9]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M Ajtai","year":"1983","unstructured":"Ajtai, M.: $${{\\Sigma _1^1}}$$-formulae on finite structures. Ann. Pure Appl. Logic 24(1), 1\u201348 (1983). https:\/\/doi.org\/10.1016\/0168-0072(83)90038-6","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for $$k$$-restrictions. ACM Trans. Algorithms 2(2), 153\u2013177 (2006). https:\/\/doi.org\/10.1145\/1150334.1150336","journal-title":"ACM Trans. Algorithms"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Chalermsook, P., et al.: From gap-ETH to FPT-inapproximability: clique, dominating set, and more. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 743\u2013754. IEEE, Berkeley, October 2017. https:\/\/doi.org\/10.1109\/FOCS.2017.74","DOI":"10.1109\/FOCS.2017.74"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Chen, Y., Flum, J.: Some lower bounds in parameterized ac$$^0$$. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 58, pp. 27:1\u201327:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2016). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.27","DOI":"10.4230\/LIPIcs.MFCS.2016.27"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979). https:\/\/doi.org\/10.1287\/moor.4.3.233","journal-title":"Math. Oper. Res."},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 624\u2013633. ACM, New York (2014). https:\/\/doi.org\/10.1145\/2591796.2591884","DOI":"10.1145\/2591796.2591884"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s00453-014-9944-y","volume":"71","author":"M Elberfeld","year":"2015","unstructured":"Elberfeld, M., Stockhusen, C., Tantau, T.: On the space and circuit complexity of parameterized problems: classes and completeness. Algorithmica 71(3), 661\u2013701 (2015). https:\/\/doi.org\/10.1007\/s00453-014-9944-y","journal-title":"Algorithmica"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\ln n$$ for approximating set cover. J. ACM 45(4), 634\u2013652 (1998). https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M Furst","year":"1984","unstructured":"Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theor. 17(1), 13\u201327 (1984). https:\/\/doi.org\/10.1007\/BF01744431","journal-title":"Math. Syst. Theor."},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"H\u00e5stad, J.: Almost optimal lower bounds for small depth circuits. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 6\u201320. ACM, New York (1986). https:\/\/doi.org\/10.1145\/12130.12132","DOI":"10.1145\/12130.12132"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974). https:\/\/doi.org\/10.1016\/S0022-0000(74)80044-9","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR12","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2"},{"key":"12_CR13","unstructured":"Lin, B.: A Simple Gap-producing Reduction for the Parameterized Set Cover Problem (2018). https:\/\/sites.google.com\/site\/bingkai314159\/gapsetcover.pdf"},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13(4), 383\u2013390 (1975). https:\/\/doi.org\/10.1016\/0012-365X(75)90058-8","journal-title":"Discrete Math."},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41(5), 960\u2013981 (1994). https:\/\/doi.org\/10.1145\/185675.306789","journal-title":"J. ACM"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-642-32512-0_24","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Dana Moshkovitz","year":"2012","unstructured":"Moshkovitz, Dana: The projection games conjecture and the NP-hardness of in n-approximating set-cover. In: Gupta, Anupam, Jansen, Klaus, Rolim, Jos\u00e9, Servedio, Rocco (eds.) APPROX\/RANDOM-2012. LNCS, vol. 7408, pp. 276\u2013287. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32512-0_24"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Murray, C., Williams, R.: Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 890\u2013901. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3188745.3188910","DOI":"10.1145\/3188745.3188910"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 475\u2013484. ACM, New York (1997). https:\/\/doi.org\/10.1145\/258533.258641","DOI":"10.1145\/258533.258641"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Rossman, B.: On the constant-depth complexity of $$k$$-clique. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 721\u2013730. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1374376.1374480","DOI":"10.1145\/1374376.1374480"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Karthik, C.S., Laekhanukit, B., Manurangsi, P.: On the parameterized complexity of approximating dominating set. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018, pp. 1283\u20131296. ACM Press, Los Angeles (2018). https:\/\/doi.org\/10.1145\/3188745.3188896","DOI":"10.1145\/3188745.3188896"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/16M1067767","volume":"31","author":"K Sarkar","year":"2017","unstructured":"Sarkar, K., Colbourn, C.J.: Upper bounds on the size of covering arrays. SIAM J. Discrete Math. 31(2), 1277\u20131293 (2017). https:\/\/doi.org\/10.1137\/16M1067767","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Slav\u0131k\u0301, P.: A tight analysis of the greedy algorithm for set cover. J. Algorithms 25(2), 237\u2013254 (1997).https:\/\/doi.org\/10.1006\/jagm.1997.0887","DOI":"10.1006\/jagm.1997.0887"},{"issue":"3","key":"12_CR23","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0097-3165(74)90062-4","volume":"16","author":"SK Stein","year":"1974","unstructured":"Stein, S.K.: Two combinatorial covering theorems. J. Comb. Theor. Ser. A 16(3), 391\u2013397 (1974). https:\/\/doi.org\/10.1016\/0097-3165(74)90062-4","journal-title":"J. Comb. Theor. Ser. A"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Williams, R.: New algorithms and lower bounds for circuits with linear threshold gates. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, STOC 2014, pp. 194\u2013202. ACM , New York (2014). https:\/\/doi.org\/10.1145\/2591796.2591858","DOI":"10.1145\/2591796.2591858"},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/2559903","volume":"61","author":"R Williams","year":"2014","unstructured":"Williams, R.: Nonuniform ACC circuit lower bounds. J. ACM 61(1), 2:1\u20132:32 (2014). https:\/\/doi.org\/10.1145\/2559903","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18126-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:18:47Z","timestamp":1709817527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18126-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030181253","9783030181260"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18126-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sanya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iiis.tsinghua.edu.cn\/~jianli\/FAW2019\/FAW2019.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}