A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs

Lokshtanov, D, Panolan, F orcid.org/0000-0001-6213-8687, Saurabh, S et al. (2 more authors) (2024) A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. In: 40th International Symposium on Computational Geometry (SoCG 2024). 40th International Symposium on Computational Geometry (SoCG 2024), 11-14 Jun 2024, Athens, Greece. Leibniz International Proceedings in Informatics (LIPIcs), 293 . Dagstuhl Publishing , 72:1-72:11. ISBN 9783959773164

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi; licensed under Creative Commons License CC-BY 4.0

Keywords: vertex cover; geometric intersection graphs; approximation algorithms
Dates:
  • Published: 6 June 2024
  • Published (online): 1 June 2024
  • Accepted: 5 February 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 14 Mar 2024 11:53
Last Modified: 24 Jul 2024 16:05
Status: Published
Publisher: Dagstuhl Publishing
Series Name: Leibniz International Proceedings in Informatics (LIPIcs)
Identification Number: 10.4230/LIPIcs.SoCG.2024.72
Open Archives Initiative ID (OAI ID):

Export

Statistics