"Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems."

Akanksha Agrawal et al. (2018)

> Home

Details and statistics

DOI: 10.4230/LIPICS.APPROX-RANDOM.2018.1

access: open

type: Conference or Workshop Paper

metadata version: 2024-01-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/approx/AgrawalLM0Z18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/AgrawalLM0Z18
Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. APPROX-RANDOM 2018: 1:1-1:15

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.