{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:23:54Z","timestamp":1743139434885,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_4","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T15:59:49Z","timestamp":1740067189000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Approximability of\u00a0Graph Visibility Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3169-4300","authenticated-orcid":false,"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9093-0679","authenticated-orcid":false,"given":"Alessia","family":"Di Fonso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4521-8356","authenticated-orcid":false,"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8848-7006","authenticated-orcid":false,"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Algorithms and Complexity","author":"P Alimonti","year":"1997","unstructured":"Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288\u2013298. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62592-5_80"},{"key":"4_CR2","first-page":"84","volume":"359","author":"BS Anand","year":"2019","unstructured":"Anand, B.S., Ullas Chandran, S.V., Changat, M., Klav\u017ear, S., Thomas, E.J.: Characterization of general position sets and its applications to cographs and bipartite graphs. Appl. Math. Comput. 359, 84\u201389 (2019)","journal-title":"Appl. Math. Comput."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Badri, S., Cicerone, S., Di Fonso, A., Di Stefano, G.: An optimal algorithm for geodesic mutual visibility on hexagonal grids. In: Proceedings of SSS 2024. LNCS, vol. 14931, pp. 161\u2013176. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-74498-3_12"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bhagat, S.: Optimum algorithm for the mutual visibility problem. In: Proceedings of WALCOM: 2020. LNCS, vol. 12049, pp. 31\u201342. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-39881-1_4"},{"key":"4_CR5","unstructured":"Bil\u00f2, D., Di Fonso, A., Di Stefano, G., Leucci, S.: On the approximability of graph visibility problems. CoRR, abs\/2407.00409 (2024)"},{"key":"4_CR6","volume":"465","author":"B Bre\u0161ar","year":"2024","unstructured":"Bre\u0161ar, B., Yero, I.G.: Lower (total) mutual-visibility number in graphs. Appl. Math. Comput. 465, 128411 (2024)","journal-title":"Appl. Math. Comput."},{"key":"4_CR7","unstructured":"Bujt\u00e1s, C., Klav\u017ear, S., Tian, J.: Total mutual-visibility in hamming graphs. arXiv (2023)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190150110","volume":"15","author":"Y Caro","year":"1991","unstructured":"Caro, Y., Tuza, Z.: Improved lower bounds on k-independence. J. Graph Theory 15(1), 99\u2013107 (1991)","journal-title":"J. Graph Theory"},{"key":"4_CR9","first-page":"135","volume":"4","author":"USV Chandran","year":"2016","unstructured":"Chandran, U.S.V., Jaya Parthasarathy, G.: The geodesic irredundant sets in graphs. Int. J. Math. Comb. 4, 135\u2013143 (2016)","journal-title":"Int. J. Math. Comb."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Fonso, A, Di Stefano, G., Navarra, A.: The geodesic mutual visibility problem for oblivious robots: the case of trees. In: Proceedings of ICDCN 2023, pp. 150\u2013159. ACM (2023)","DOI":"10.1145\/3571306.3571401"},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2023.101842","volume":"95","author":"S Cicerone","year":"2023","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: The geodesic mutual visibility problem: oblivious robots on grids and trees. Pervasive Mob. Comput. 95, 101842 (2023)","journal-title":"Pervasive Mob. Comput."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: Time-optimal geodesic mutual visibility of robots on grids within minimum area. In: Proceedings of SSS 2023. LNCS, vol. 14310, pp. 385\u2013399. Springer (2023)","DOI":"10.1007\/978-3-031-44274-2_29"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A., Piselli, F.: Mutual visibility in hypercube-like graphs. In: Proceedings of SIROCCO 2024. LNCS, vol. 14662, pp. 192\u2013207. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-60603-8_11"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Stefano, G.: Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. In: Proceedings of LAGOS 2023, vol. 223, pp. 104\u2013111. Elsevier (2023)","DOI":"10.1016\/j.procs.2023.08.219"},{"key":"4_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114096","volume":"974","author":"S Cicerone","year":"2023","unstructured":"Cicerone, S., Di Stefano, G., Dro\u017eek, L., Hed\u017eet, J., Klav\u017ear, S., Yero, I.G.: Variety of mutual-visibility problems in graphs. Theor. Comput. Sci. 974, 114096 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR16","volume":"438","author":"S Cicerone","year":"2023","unstructured":"Cicerone, S., Di Stefano, G., Klav\u017ear, S.: On the mutual visibility in Cartesian products and triangle-free graphs. Appl. Math. Comput. 438, 127619 (2023)","journal-title":"Appl. Math. Comput."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.dam.2024.06.038","volume":"358","author":"S Cicerone","year":"2024","unstructured":"Cicerone, S., Di Stefano, G., Klav\u017ear, S., Yero, I.G.: Mutual-visibility in strong products of graphs via total mutual-visibility. Discret. Appl. Math. 358, 136\u2013146 (2024)","journal-title":"Discret. Appl. Math."},{"key":"4_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2024.103995","volume":"120","author":"S Cicerone","year":"2024","unstructured":"Cicerone, S., Di Stefano, G., Klav\u017ear, S., Yero, I.G.: Mutual-visibility problems on graphs of diameter two. Eur. J. Comb. 120, 103995 (2024)","journal-title":"Eur. J. Comb."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ic.2016.09.005","volume":"254","author":"GA Di Luna","year":"2017","unstructured":"Di Luna, G.A., Flocchini, P., Chaudhuri, S.G., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392\u2013418 (2017)","journal-title":"Inf. Comput."},{"key":"4_CR20","volume":"419","author":"G Di Stefano","year":"2022","unstructured":"Di Stefano, G.: Mutual visibility in graphs. Appl. Math. Comput. 419, 126850 (2022)","journal-title":"Appl. Math. Comput."},{"key":"4_CR21","volume-title":"Amusements in Mathematics","author":"HE Dudeney","year":"1917","unstructured":"Dudeney, H.E.: Amusements in Mathematics. Nelson, Edinburgh (1917)"},{"key":"4_CR22","first-page":"123","volume":"76","author":"S Klav\u017ear","year":"2021","unstructured":"Klav\u017ear, S., Patk\u00f3s, B., Rus, G., Yero, I.G.: On general position sets in Cartesian products. RM 76, 123 (2021)","journal-title":"RM"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s40840-023-01590-3","volume":"46","author":"D Kuziak","year":"2023","unstructured":"Kuziak, D., Rodr\u00edguez-Vel\u00e1zquez, J.A.: Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products. Bull. Malays. Math. Sci. Soc. 46, 197 (2023)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1017\/S0004972718000473","volume":"98","author":"P Manuel","year":"2018","unstructured":"Manuel, P., Klav\u017ear, S.: A general position problem in graph theory. Bull. Aust. Math. Soc. 98(2), 177\u2013187 (2018)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"4","key":"4_CR25","first-page":"339","volume":"163","author":"PD Manuel","year":"2018","unstructured":"Manuel, P.D., Klav\u017ear, S.: The graph theory general position problem on some interconnection networks. Fund. Inform. 163(4), 339\u2013350 (2018)","journal-title":"Fund. Inform."},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2020.10.033","volume":"850","author":"P Poudel","year":"2021","unstructured":"Poudel, P., Aljohani, A., Sharma, G.: Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement. Theor. Comput. Sci. 850, 116\u2013134 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Shachnai, H., Srinivasan, A.: Finding large independent sets of hypergraphs in parallel. In: Rosenberg, A.L. (ed.) Proceedings of SPAA 2001, pp. 163\u2013168. ACM (2001)","DOI":"10.1145\/378580.378622"},{"issue":"1","key":"4_CR28","first-page":"50","volume":"11","author":"G Sharma","year":"2021","unstructured":"Sharma, G., Vaidyanathan, R., Trahan, J.L.: Optimal randomized complete visibility on a grid for asynchronous robots with lights. Int. J. Netw. Comput. 11(1), 50\u201377 (2021)","journal-title":"Int. J. Netw. Comput."},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.7151\/dmgt.2496","volume":"44","author":"J Tian","year":"2024","unstructured":"Tian, J., Klav\u017ear, S.: Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products. Discussiones Mathematicae. Graph Theory 44(4), 1277\u20131291 (2024)","journal-title":"Discussiones Mathematicae. Graph Theory"},{"key":"4_CR30","volume":"403","author":"J Tian","year":"2021","unstructured":"Tian, J., Kexiang, X.: The general position number of Cartesian products involving a factor with small diameter. Appl. Math. Comput. 403, 126206 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"4_CR31","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103\u2013128 (2007)","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T15:59:55Z","timestamp":1740067195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}