Abstract
In this paper, we prove several inapproximability results on the P3-convexity and the geodesic convexity in graphs. We prove that determining the P3-hull number and the geodetic hull number are APX-hard problems. We prove that the Carathéodory number, the Radon number and the convexity number of both convexities are O(n1−ε)-inapproximable in polynomial time for every ε>0, unless P=NP. We also prove that the interval numbers of both convexities are W[2]-hard and O(logn)-inapproximable in polynomial time, unless P=NP. Moreover, these results hold for bipartite graphs in the P3-convexity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
