{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:38:37Z","timestamp":1743125917663,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030394783"},{"type":"electronic","value":"9783030394790"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-39479-0_14","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T20:03:47Z","timestamp":1579896227000},"page":"202-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved (In-)Approximability Bounds for d-Scattered Set"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Katsikarelis","sequence":"first","affiliation":[]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,25]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/BF01277956","volume":"5","author":"N Alon","year":"1995","unstructured":"Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized graph products. Comput. Complex. 5(1), 60\u201375 (1995)","journal-title":"Comput. Complex."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-48523-6_17","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1999","unstructured":"Berman, P., Karpinski, M.: On some tighter inapproximability results (Extended Abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 200\u2013209. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48523-6_17"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0401033","volume":"1","author":"B Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B., Chung, F.R.K.: The diameter of a cycle plus a random matching. SIAM J. Discret. Math. 1(3), 328\u2013333 (1988)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR4","unstructured":"Bonnet, E., Lampis, M., Paschos, V.Th.: Time-approximation trade-offs for inapproximable problems. In: STACS, LIPIcs, vol. 47, pp. 22:1\u201322:14 (2016)"},{"issue":"17","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1016\/j.dam.2011.07.009","volume":"159","author":"Nicolas Bourgeois","year":"2011","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.Th.: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159(17), 1954\u20131970 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Independent set, induced matching, and pricing: connections and tight (subexponential time) approximation hardnesses. In: FOCS, vol. 47, pp. 370\u2013379 (2013)","DOI":"10.1109\/FOCS.2013.47"},{"key":"14_CR7","unstructured":"Cygan, M., Kowalik, L., Pilipczuk, M., Wykurz, M.: Exponential-time approximation of hard problems. CoRR, abs\/0810.4934 (2008)"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0893-9659(97)00044-X","volume":"10","author":"M. Demange","year":"1997","unstructured":"Demange, M., Paschos, V.Th.: Improved approximations for maximum independent set via approximation chains. Appl. Math. Lett. 10(3), 105\u2013110 (1997)","journal-title":"Applied Mathematics Letters"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/s10878-012-9594-4","volume":"27","author":"H Eto","year":"2014","unstructured":"Eto, H., Guo, F., Miyano, E.: Distance- $$d$$ independent set problems for bipartite and chordal graphs. J. Comb. Optim. 27(1), 88\u201399 (2014)","journal-title":"J. Comb. Optim."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-48749-6_20","volume-title":"Combinatorial Optimization and Applications","author":"H Eto","year":"2016","unstructured":"Eto, H., Ito, T., Liu, Z., Miyano, E.: Approximability of the distance independent set problem on regular graphs and planar graphs. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 270\u2013284. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48749-6_20"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-319-53925-6_18","volume-title":"WALCOM: Algorithms and Computation","author":"H Eto","year":"2017","unstructured":"Eto, H., Ito, T., Liu, Z., Miyano, E.: Approximation algorithm for the distance-3 independent set problem on cubic graphs. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 228\u2013240. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-53925-6_18"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Bidimensionality and EPTAS. In: SODA, pp. 748\u2013759. SIAM (2011)","DOI":"10.1137\/1.9781611973082.59"},{"issue":"1\u20133","key":"14_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0166-218X(99)00124-9","volume":"99","author":"MM Halld\u00f3rsson","year":"2000","unstructured":"Halld\u00f3rsson, M.M., Kratochvil, J., Telle, J.A.: Independent sets with domination constraints. Discret. Appl. Math. 99(1\u20133), 39\u201354 (2000)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"MM Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: approximating independent sets in sparse and bounded-degree graphs. Algorithmica 18(1), 145\u2013163 (1997)","journal-title":"Algorithmica"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$. Acta Mathematica 182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"14_CR17","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-00256-5_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Ioannis Katsikarelis","year":"2018","unstructured":"Katsikarelis, I., Lampis, M., Paschos, V.Th.: Structurally parameterized $$d$$-scattered set. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) WG. LNCS, pp. 292\u2013305, vol. 11159. Springer, Heidelberg (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-00256-5_24"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-3-662-48350-3_72","volume-title":"Algorithms \u2013 ESA 2015","author":"D Marx","year":"2015","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 865\u2013877. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48350-3_72"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-662-53536-3_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"P Montealegre","year":"2016","unstructured":"Montealegre, P., Todinca, I.: On distance-d independent set and other problems in graphs with \u201cfew\u201d minimal separators. In: Heggernes, P. (ed.) WG 2016. LNCS, vol. 9941, pp. 183\u2013194. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53536-3_16"},{"key":"14_CR21","unstructured":"Pilipczuk, M., Siebertz, S.: Kernelization and approximation of distance-r independent sets on nowhere dense graphs. CoRR, abs\/1809.05675 (2018)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39479-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T08:05:39Z","timestamp":1583741139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39479-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030394783","9783030394790"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39479-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"12 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2019.ak.in.tum.de\/index.php\/menue-waoa\/waoa-overview","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}