"A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs."

Daniel Lokshtanov et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.SOCG.2024.72

access: open

type: Conference or Workshop Paper

metadata version: 2024-06-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/compgeom/LokshtanovP00Z24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compgeom/LokshtanovP00Z24
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi:
A 1.9999-Approximation Algorithm for Vertex Cover on String Graphs. SoCG 2024: 72:1-72:11

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.