"A polynomial-time OPTɛ-approximation algorithm for maximum ..."

Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki (2024)

> Home

Details and statistics

DOI: 10.1137/1.9781611977912.23

access: closed

type: Conference or Workshop Paper

metadata version: 2024-04-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/soda/CslovjecsekPW24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/CslovjecsekPW24
Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
A polynomial-time OPT^ɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. SODA 2024: 625-638

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.